[{"citation":{"ieee":"R. I. McLachlan and C. Offen, “Bifurcation of solutions to Hamiltonian boundary value problems,” <i>Nonlinearity</i>, pp. 2895–2927, 2018.","apa":"McLachlan, R. I., &#38; Offen, C. (2018). Bifurcation of solutions to Hamiltonian boundary value problems. <i>Nonlinearity</i>, 2895–2927. <a href=\"https://doi.org/10.1088/1361-6544/aab630\">https://doi.org/10.1088/1361-6544/aab630</a>","mla":"McLachlan, Robert I., and Christian Offen. “Bifurcation of Solutions to Hamiltonian Boundary Value Problems.” <i>Nonlinearity</i>, 2018, pp. 2895–927, doi:<a href=\"https://doi.org/10.1088/1361-6544/aab630\">10.1088/1361-6544/aab630</a>.","bibtex":"@article{McLachlan_Offen_2018, title={Bifurcation of solutions to Hamiltonian boundary value problems}, DOI={<a href=\"https://doi.org/10.1088/1361-6544/aab630\">10.1088/1361-6544/aab630</a>}, journal={Nonlinearity}, author={McLachlan, Robert I and Offen, Christian}, year={2018}, pages={2895–2927} }","ama":"McLachlan RI, Offen C. Bifurcation of solutions to Hamiltonian boundary value problems. <i>Nonlinearity</i>. 2018:2895-2927. doi:<a href=\"https://doi.org/10.1088/1361-6544/aab630\">10.1088/1361-6544/aab630</a>","short":"R.I. McLachlan, C. Offen, Nonlinearity (2018) 2895–2927.","chicago":"McLachlan, Robert I, and Christian Offen. “Bifurcation of Solutions to Hamiltonian Boundary Value Problems.” <i>Nonlinearity</i>, 2018, 2895–2927. <a href=\"https://doi.org/10.1088/1361-6544/aab630\">https://doi.org/10.1088/1361-6544/aab630</a>."},"status":"public","user_id":"85279","page":"2895-2927","_id":"19935","extern":"1","abstract":[{"text":"A bifurcation is a qualitative change in a family of solutions to an equation produced by varying parameters. In contrast to the local bifurcations of dynamical systems that are often related to a change in the number or stability of equilibria, bifurcations of boundary value problems are global in nature and may not be related to any obvious change in dynamical behaviour. Catastrophe theory is a well-developed framework which studies the bifurcations of critical points of functions. In this paper we study the bifurcations of solutions of boundary-value problems for symplectic maps, using the language of (finite-dimensional) singularity theory. We associate certain such problems with a geometric picture involving the intersection of Lagrangian submanifolds, and hence with the critical points of a suitable generating function. Within this framework, we then study the effect of three special cases: (i) some common boundary conditions, such as Dirichlet boundary conditions for second-order systems, restrict the possible types of bifurcations (for example, in generic planar systems only the A-series beginning with folds and cusps can occur); (ii) integrable systems, such as planar Hamiltonian systems, can exhibit a novel periodic pitchfork bifurcation; and (iii) systems with Hamiltonian symmetries or reversing symmetries can exhibit restricted bifurcations associated with the symmetry. This approach offers an alternative to the analysis of critical points in function spaces, typically used in the study of bifurcation of variational problems, and opens the way to the detection of more exotic bifurcations than the simple folds and cusps that are often found in examples. ","lang":"eng"}],"publication":"Nonlinearity","type":"journal_article","department":[{"_id":"636"}],"date_created":"2020-10-06T16:28:36Z","publication_status":"published","date_updated":"2022-01-06T06:54:14Z","article_type":"original","year":"2018","title":"Bifurcation of solutions to Hamiltonian boundary value problems","publication_identifier":{"issn":["0951-7715","1361-6544"]},"author":[{"full_name":"McLachlan, Robert I","last_name":"McLachlan","first_name":"Robert I"},{"full_name":"Offen, Christian","last_name":"Offen","first_name":"Christian","orcid":"https://orcid.org/0000-0002-5940-8057","id":"85279"}],"doi":"10.1088/1361-6544/aab630","main_file_link":[{"url":"https://doi.org/10.1088/1361-6544/aab630"}],"language":[{"iso":"eng"}]},{"publication_status":"published","date_updated":"2022-01-06T06:54:14Z","article_type":"original","year":"2018","title":"Symplectic integration of boundary value problems","author":[{"full_name":"McLachlan, Robert I","last_name":"McLachlan","first_name":"Robert I"},{"full_name":"Offen, Christian","last_name":"Offen","first_name":"Christian","orcid":"https://orcid.org/0000-0002-5940-8057","id":"85279"}],"publication_identifier":{"issn":["1017-1398","1572-9265"]},"doi":"10.1007/s11075-018-0599-7","main_file_link":[{"url":"https://rdcu.be/b79ap"}],"language":[{"iso":"eng"}],"extern":"1","abstract":[{"text":"Symplectic integrators can be excellent for Hamiltonian initial value problems. Reasons for this include their preservation of invariant sets like tori, good energy behaviour, nonexistence of attractors, and good behaviour of statistical properties. These all refer to {\\em long-time} behaviour. They are directly connected to the dynamical behaviour of symplectic maps φ:M→M' on the phase space under iteration. Boundary value problems, in contrast, are posed for fixed (and often quite short) times. Symplecticity manifests as a symplectic map φ:M→M' which is not iterated. Is there any point, therefore, for a symplectic integrator to be used on a Hamiltonian boundary value problem? In this paper we announce results that symplectic integrators preserve bifurcations of Hamiltonian boundary value problems and that nonsymplectic integrators do not.","lang":"eng"}],"publication":"Numerical Algorithms","type":"journal_article","department":[{"_id":"636"}],"date_created":"2020-10-06T16:29:14Z","status":"public","user_id":"85279","page":"1219-1233","_id":"19937","citation":{"ama":"McLachlan RI, Offen C. Symplectic integration of boundary value problems. <i>Numerical Algorithms</i>. 2018:1219-1233. doi:<a href=\"https://doi.org/10.1007/s11075-018-0599-7\">10.1007/s11075-018-0599-7</a>","bibtex":"@article{McLachlan_Offen_2018, title={Symplectic integration of boundary value problems}, DOI={<a href=\"https://doi.org/10.1007/s11075-018-0599-7\">10.1007/s11075-018-0599-7</a>}, journal={Numerical Algorithms}, author={McLachlan, Robert I and Offen, Christian}, year={2018}, pages={1219–1233} }","mla":"McLachlan, Robert I., and Christian Offen. “Symplectic Integration of Boundary Value Problems.” <i>Numerical Algorithms</i>, 2018, pp. 1219–33, doi:<a href=\"https://doi.org/10.1007/s11075-018-0599-7\">10.1007/s11075-018-0599-7</a>.","short":"R.I. McLachlan, C. Offen, Numerical Algorithms (2018) 1219–1233.","chicago":"McLachlan, Robert I, and Christian Offen. “Symplectic Integration of Boundary Value Problems.” <i>Numerical Algorithms</i>, 2018, 1219–33. <a href=\"https://doi.org/10.1007/s11075-018-0599-7\">https://doi.org/10.1007/s11075-018-0599-7</a>.","apa":"McLachlan, R. I., &#38; Offen, C. (2018). Symplectic integration of boundary value problems. <i>Numerical Algorithms</i>, 1219–1233. <a href=\"https://doi.org/10.1007/s11075-018-0599-7\">https://doi.org/10.1007/s11075-018-0599-7</a>","ieee":"R. I. McLachlan and C. Offen, “Symplectic integration of boundary value problems,” <i>Numerical Algorithms</i>, pp. 1219–1233, 2018."}},{"_id":"19978","language":[{"iso":"eng"}],"user_id":"15415","author":[{"full_name":"Markarian, Christine","last_name":"Markarian","first_name":"Christine"}],"title":"Online Connected Dominating Set Leasing","status":"public","year":"2018","date_updated":"2022-01-06T06:54:17Z","date_created":"2020-10-12T12:42:54Z","department":[{"_id":"63"}],"type":"preprint","citation":{"mla":"Markarian, Christine. “Online Connected Dominating Set Leasing.” <i>ArXiv:1805.02994</i>, 2018.","apa":"Markarian, C. (2018). Online Connected Dominating Set Leasing. <i>ArXiv:1805.02994</i>.","ieee":"C. Markarian, “Online Connected Dominating Set Leasing,” <i>arXiv:1805.02994</i>. 2018.","ama":"Markarian C. Online Connected Dominating Set Leasing. <i>arXiv:180502994</i>. 2018.","short":"C. Markarian, ArXiv:1805.02994 (2018).","chicago":"Markarian, Christine. “Online Connected Dominating Set Leasing.” <i>ArXiv:1805.02994</i>, 2018.","bibtex":"@article{Markarian_2018, title={Online Connected Dominating Set Leasing}, journal={arXiv:1805.02994}, author={Markarian, Christine}, year={2018} }"},"publication":"arXiv:1805.02994","abstract":[{"text":"We introduce the \\emph{Online Connected Dominating Set Leasing} problem\r\n(OCDSL) in which we are given an undirected connected graph $G = (V, E)$, a set\r\n$\\mathcal{L}$ of lease types each characterized by a duration and cost, and a\r\nsequence of subsets of $V$ arriving over time. A node can be leased using lease\r\ntype $l$ for cost $c_l$ and remains active for time $d_l$. The adversary gives\r\nin each step $t$ a subset of nodes that need to be dominated by a connected\r\nsubgraph consisting of nodes active at time $t$. The goal is to minimize the\r\ntotal leasing costs. OCDSL contains the \\emph{Parking Permit\r\nProblem}~\\cite{PPP} as a special subcase and generalizes the classical offline\r\n\\emph{Connected Dominating Set} problem~\\cite{Guha1998}. It has an $\\Omega(\\log\r\n^2 n + \\log |\\mathcal{L}|)$ randomized lower bound resulting from lower bounds\r\nfor the \\emph{Parking Permit Problem} and the \\emph{Online Set Cover}\r\nproblem~\\cite{Alon:2003:OSC:780542.780558,Korman}, where $|\\mathcal{L}|$ is the\r\nnumber of available lease types and $n$ is the number of nodes in the input\r\ngraph. We give a randomized $\\mathcal{O}(\\log ^2 n + \\log |\\mathcal{L}| \\log\r\nn)$-competitive algorithm for OCDSL. We also give a deterministic algorithm for\r\na variant of OCDSL in which the dominating subgraph need not be connected, the\r\n\\emph{Online Dominating Set Leasing} problem. The latter is based on a simple\r\nprimal-dual approach and has an $\\mathcal{O}(|\\mathcal{L}| \\cdot\r\n\\Delta)$-competitive ratio, where $\\Delta$ is the maximum degree of the input\r\ngraph.","lang":"eng"}]},{"author":[{"id":"24135","full_name":"Lass, Michael","orcid":"0000-0002-5708-7632","first_name":"Michael","last_name":"Lass"},{"full_name":"Kühne, Thomas","last_name":"Kühne","first_name":"Thomas","id":"49079"},{"id":"16153","first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian"}],"publication_identifier":{"eissn":["1943-0671"],"issn":["1943-0663"]},"year":"2018","title":"Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots","intvolume":"        10","date_updated":"2022-01-06T06:54:18Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1109/LES.2017.2760923","issue":"2","publication":"Embedded Systems Letters","abstract":[{"lang":"eng","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."}],"date_created":"2017-07-25T14:41:08Z","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"type":"journal_article","status":"public","_id":"20","publisher":"IEEE","page":" 33-36","volume":10,"user_id":"16153","citation":{"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} }","short":"M. Lass, T. Kühne, C. Plessl, Embedded Systems Letters 10 (2018) 33–36.","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>","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>.","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.","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>","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>."},"project":[{"name":"Performance and Efficiency in HPC with Custom Computing","grant_number":"PL 595/2-1","_id":"32"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"external_id":{"arxiv":["1703.02283"]}},{"department":[{"_id":"600"}],"type":"conference","date_created":"2020-10-23T16:46:30Z","citation":{"bibtex":"@inproceedings{Habernal_Wachsmuth_Gurevych_Stein_2018, title={The Argument Reasoning Comprehension Task: Identification and Reconstruction of Implicit Warrants}, booktitle={Proceedings of the 16th Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies}, author={Habernal, Ivan and Wachsmuth, Henning and Gurevych, Iryna and Stein, Benno}, year={2018}, pages={1930–1940} }","ama":"Habernal I, Wachsmuth H, Gurevych I, Stein B. The Argument Reasoning Comprehension Task: Identification and Reconstruction of Implicit Warrants. In: <i>Proceedings of the 16th Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</i>. ; 2018:1930–1940.","mla":"Habernal, Ivan, et al. “The Argument Reasoning Comprehension Task: Identification and Reconstruction of Implicit Warrants.” <i>Proceedings of the 16th Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</i>, 2018, pp. 1930–1940.","chicago":"Habernal, Ivan, Henning Wachsmuth, Iryna Gurevych, and Benno Stein. “The Argument Reasoning Comprehension Task: Identification and Reconstruction of Implicit Warrants.” In <i>Proceedings of the 16th Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</i>, 1930–1940, 2018.","short":"I. Habernal, H. Wachsmuth, I. Gurevych, B. Stein, in: Proceedings of the 16th Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2018, pp. 1930–1940.","ieee":"I. Habernal, H. Wachsmuth, I. Gurevych, and B. Stein, “The Argument Reasoning Comprehension Task: Identification and Reconstruction of Implicit Warrants,” in <i>Proceedings of the 16th Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</i>, 2018, pp. 1930–1940.","apa":"Habernal, I., Wachsmuth, H., Gurevych, I., &#38; Stein, B. (2018). The Argument Reasoning Comprehension Task: Identification and Reconstruction of Implicit Warrants. In <i>Proceedings of the 16th Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</i> (pp. 1930–1940)."},"publication":"Proceedings of the 16th Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies","user_id":"82920","language":[{"iso":"eng"}],"_id":"20188","page":"1930–1940","date_updated":"2022-01-06T06:54:21Z","author":[{"full_name":"Habernal, Ivan","first_name":"Ivan","last_name":"Habernal"},{"last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning","id":"3900"},{"full_name":"Gurevych, Iryna","first_name":"Iryna","last_name":"Gurevych"},{"last_name":"Stein","first_name":"Benno","full_name":"Stein, Benno"}],"year":"2018","status":"public","title":"The Argument Reasoning Comprehension Task: Identification and Reconstruction of Implicit Warrants"},{"publication_identifier":{"isbn":["978-1-4503-5916-0"]},"author":[{"full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","first_name":"Matthias","last_name":"Feldotto","id":"14052"},{"full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen","id":"20801"},{"id":"40384","first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander"},{"last_name":"Stroh-Maraun","first_name":"Nadja","full_name":"Stroh-Maraun, Nadja","id":"13264"}],"year":"2018","title":"Disaggregating User Evaluations Using the Shapley Value","publication_status":"published","date_updated":"2022-01-06T06:58:01Z","language":[{"iso":"eng"}],"doi":"10.1145/3230654.3230659","publication":"Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)","abstract":[{"text":"We consider a market where final products or services are compositions of a number of basic services. Users are asked to evaluate the quality of the composed product after purchase. The quality of the basic service influences the performance of the composed services but cannot be observed directly. The question we pose is whether it is possible to use user evaluations on composed services to assess the quality of basic services. We discuss how to combine aggregation of evaluations across users and disaggregation of information on composed services to derive valuations for the single components. As a solution we propose to use the (weighted) average as aggregation device in connection with the Shapley value as disaggregation method, since this combination fulfills natural requirements in our context. In addition, we address some occurring computational issues: We give an approximate solution concept using only a limited number of evaluations which guarantees nearly optimal results with reduced running time. Lastly, we show that a slightly modified Shapley value and the weighted average are still applicable if the evaluation profiles are incomplete.","lang":"eng"}],"date_created":"2018-05-22T10:28:51Z","file":[{"date_created":"2018-08-15T07:30:50Z","creator":"nmaraun","file_id":"3910","content_type":"application/pdf","success":1,"file_name":"Disaggregating User Evaluations Using the Shapley Value.pdf","file_size":1450171,"access_level":"closed","relation":"main_file","date_updated":"2018-08-15T07:30:50Z"}],"department":[{"_id":"541"},{"_id":"63"},{"_id":"205"},{"_id":"475"}],"type":"conference","conference":{"end_date":"2018-06-18","start_date":"2018-06-18","name":"The 13th Workshop on the Economics of Networks, Systems and Computation (NetEcon 2018)","location":"Irvine, California, USA"},"status":"public","has_accepted_license":"1","_id":"2831","page":"5:1-5:6","user_id":"14052","ddc":["040"],"citation":{"chicago":"Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun. “Disaggregating User Evaluations Using the Shapley Value.” In <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>, 5:1-5:6, 2018. <a href=\"https://doi.org/10.1145/3230654.3230659\">https://doi.org/10.1145/3230654.3230659</a>.","short":"M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6.","ama":"Feldotto M, Haake C-J, Skopalik A, Stroh-Maraun N. Disaggregating User Evaluations Using the Shapley Value. In: <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>. ; 2018:5:1-5:6. doi:<a href=\"https://doi.org/10.1145/3230654.3230659\">10.1145/3230654.3230659</a>","bibtex":"@inproceedings{Feldotto_Haake_Skopalik_Stroh-Maraun_2018, title={Disaggregating User Evaluations Using the Shapley Value}, DOI={<a href=\"https://doi.org/10.1145/3230654.3230659\">10.1145/3230654.3230659</a>}, booktitle={Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)}, author={Feldotto, Matthias and Haake, Claus-Jochen and Skopalik, Alexander and Stroh-Maraun, Nadja}, year={2018}, pages={5:1-5:6} }","apa":"Feldotto, M., Haake, C.-J., Skopalik, A., &#38; Stroh-Maraun, N. (2018). Disaggregating User Evaluations Using the Shapley Value. In <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i> (pp. 5:1-5:6). Irvine, California, USA. <a href=\"https://doi.org/10.1145/3230654.3230659\">https://doi.org/10.1145/3230654.3230659</a>","mla":"Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley Value.” <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>, 2018, pp. 5:1-5:6, doi:<a href=\"https://doi.org/10.1145/3230654.3230659\">10.1145/3230654.3230659</a>.","ieee":"M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating User Evaluations Using the Shapley Value,” in <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>, Irvine, California, USA, 2018, pp. 5:1-5:6."},"file_date_updated":"2018-08-15T07:30:50Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}]},{"author":[{"full_name":"Li, Shouwei","last_name":"Li","first_name":"Shouwei"},{"full_name":"Markarian, Christine","last_name":"Markarian","first_name":"Christine","id":"37612"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"year":"2018","title":"Towards Flexible Demands in Online Leasing Problems. ","intvolume":"        80","date_updated":"2022-01-06T06:58:06Z","language":[{"iso":"eng"}],"doi":"10.1007/s00453-018-0420-y","issue":"5","publication":"Algorithmica","date_created":"2018-05-24T08:32:38Z","file":[{"creator":"ups","date_created":"2018-11-02T15:18:16Z","access_level":"closed","file_size":600583,"file_name":"TowardsFlexibleDemandsInOnline.pdf","date_updated":"2018-11-02T15:18:16Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5298"}],"department":[{"_id":"63"}],"type":"journal_article","status":"public","has_accepted_license":"1","publisher":"Springer","_id":"2848","page":"1556–1574","volume":80,"ddc":["000"],"user_id":"477","citation":{"chicago":"Li, Shouwei, Christine Markarian, and Friedhelm Meyer auf der Heide. “Towards Flexible Demands in Online Leasing Problems. .” <i>Algorithmica</i> 80, no. 5 (2018): 1556–1574. <a href=\"https://doi.org/10.1007/s00453-018-0420-y\">https://doi.org/10.1007/s00453-018-0420-y</a>.","short":"S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.","apa":"Li, S., Markarian, C., &#38; Meyer auf der Heide, F. (2018). Towards Flexible Demands in Online Leasing Problems. . <i>Algorithmica</i>, <i>80</i>(5), 1556–1574. <a href=\"https://doi.org/10.1007/s00453-018-0420-y\">https://doi.org/10.1007/s00453-018-0420-y</a>","ieee":"S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands in Online Leasing Problems. ,” <i>Algorithmica</i>, vol. 80, no. 5, pp. 1556–1574, 2018.","ama":"Li S, Markarian C, Meyer auf der Heide F. Towards Flexible Demands in Online Leasing Problems. . <i>Algorithmica</i>. 2018;80(5):1556–1574. doi:<a href=\"https://doi.org/10.1007/s00453-018-0420-y\">10.1007/s00453-018-0420-y</a>","bibtex":"@article{Li_Markarian_Meyer auf der Heide_2018, title={Towards Flexible Demands in Online Leasing Problems. }, volume={80}, DOI={<a href=\"https://doi.org/10.1007/s00453-018-0420-y\">10.1007/s00453-018-0420-y</a>}, number={5}, journal={Algorithmica}, publisher={Springer}, author={Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2018}, pages={1556–1574} }","mla":"Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .” <i>Algorithmica</i>, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:<a href=\"https://doi.org/10.1007/s00453-018-0420-y\">10.1007/s00453-018-0420-y</a>."},"file_date_updated":"2018-11-02T15:18:16Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}]},{"file_date_updated":"2018-11-02T15:24:32Z","citation":{"chicago":"Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide, and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” <i>Theory of Computing Systems</i>, 2018. <a href=\"https://doi.org/10.1007/s00224-017-9836-z\">https://doi.org/10.1007/s00224-017-9836-z</a>.","ama":"Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. <i>Theory of Computing Systems</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s00224-017-9836-z\">10.1007/s00224-017-9836-z</a>","short":"F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory of Computing Systems (2018).","bibtex":"@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2018, title={Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks}, DOI={<a href=\"https://doi.org/10.1007/s00224-017-9836-z\">10.1007/s00224-017-9836-z</a>}, journal={Theory of Computing Systems}, publisher={Springer}, author={Abu-Khzam, Faisal N.  and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2018} }","apa":"Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M. (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. <i>Theory of Computing Systems</i>. <a href=\"https://doi.org/10.1007/s00224-017-9836-z\">https://doi.org/10.1007/s00224-017-9836-z</a>","mla":"Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” <i>Theory of Computing Systems</i>, Springer, 2018, doi:<a href=\"https://doi.org/10.1007/s00224-017-9836-z\">10.1007/s00224-017-9836-z</a>.","ieee":"F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,” <i>Theory of Computing Systems</i>, 2018."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","has_accepted_license":"1","_id":"2849","publisher":"Springer","ddc":["000"],"user_id":"477","publication":"Theory of Computing Systems","file":[{"creator":"ups","date_created":"2018-11-02T15:24:32Z","relation":"main_file","date_updated":"2018-11-02T15:24:32Z","file_name":"ApproximationAndHeuristicAlgor.pdf","file_size":1371624,"access_level":"closed","file_id":"5301","content_type":"application/pdf","success":1}],"date_created":"2018-05-24T08:39:15Z","type":"journal_article","department":[{"_id":"63"}],"title":"Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks","year":"2018","author":[{"last_name":"Abu-Khzam","first_name":"Faisal N. ","full_name":"Abu-Khzam, Faisal N. "},{"id":"37612","first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"last_name":"Schubert","first_name":"Michael","full_name":"Schubert, Michael"}],"publication_identifier":{"unknown":["1432-4350"]},"date_updated":"2022-01-06T06:58:06Z","language":[{"iso":"eng"}],"doi":"10.1007/s00224-017-9836-z"},{"date_created":"2018-05-24T08:41:48Z","file":[{"date_created":"2018-11-13T13:15:19Z","creator":"feldi","success":1,"content_type":"application/pdf","file_id":"5536","date_updated":"2018-11-13T13:15:19Z","relation":"main_file","access_level":"closed","file_size":554298,"file_name":"LIPIcs-FUN-2018-22.pdf"}],"department":[{"_id":"63"},{"_id":"238"}],"type":"conference","citation":{"short":"H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International Conference on Fun with Algorithms (FUN), 2018.","chicago":"Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and Mostafa Wahby. “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” In <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>.","apa":"Hamann, H., Markarian, C., Meyer auf der Heide, F., &#38; Wahby, M. (2018). Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. <a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>","ieee":"H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets,” in <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018.","ama":"Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In: <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. ; 2018. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>","bibtex":"@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>}, booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann, Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa}, year={2018} }","mla":"Hamann, Heiko, et al. “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>."},"file_date_updated":"2018-11-13T13:15:19Z","publication":"Ninth International Conference on Fun with Algorithms (FUN)","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"language":[{"iso":"eng"}],"_id":"2850","user_id":"15415","ddc":["000"],"doi":"10.4230/LIPIcs.FUN.2018.22","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine","id":"37612"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Wahby, Mostafa","first_name":"Mostafa","last_name":"Wahby"}],"status":"public","year":"2018","title":"Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets","has_accepted_license":"1","date_updated":"2022-01-06T06:58:07Z"},{"citation":{"mla":"Mohr, Felix, et al. “Programmatic Task Network Planning.” <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>, AAAI, 2018, pp. 31–39.","ama":"Mohr F, Lettmann T, Hüllermeier E, Wever MD. Programmatic Task Network Planning. In: <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>. AAAI; 2018:31-39.","bibtex":"@inproceedings{Mohr_Lettmann_Hüllermeier_Wever_2018, title={Programmatic Task Network Planning}, booktitle={Proceedings of the 1st ICAPS Workshop on Hierarchical Planning}, publisher={AAAI}, author={Mohr, Felix and Lettmann, Theodor and Hüllermeier, Eyke and Wever, Marcel Dominik}, year={2018}, pages={31–39} }","apa":"Mohr, F., Lettmann, T., Hüllermeier, E., &#38; Wever, M. D. (2018). Programmatic Task Network Planning. In <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i> (pp. 31–39). Delft, Netherlands: AAAI.","ieee":"F. Mohr, T. Lettmann, E. Hüllermeier, and M. D. Wever, “Programmatic Task Network Planning,” in <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>, Delft, Netherlands, 2018, pp. 31–39.","chicago":"Mohr, Felix, Theodor Lettmann, Eyke Hüllermeier, and Marcel Dominik Wever. “Programmatic Task Network Planning.” In <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>, 31–39. AAAI, 2018.","short":"F. Mohr, T. Lettmann, E. Hüllermeier, M.D. Wever, in: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39."},"file_date_updated":"2018-11-06T15:18:26Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"oa":"1","conference":{"end_date":"2018-06-29","location":"Delft, Netherlands","start_date":"2018-06-24","name":"28th International Conference on Automated Planning and Scheduling"},"status":"public","has_accepted_license":"1","publisher":"AAAI","_id":"2857","page":"31-39","ddc":["000"],"user_id":"315","publication":"Proceedings of the 1st ICAPS Workshop on Hierarchical Planning","date_created":"2018-05-24T09:00:20Z","file":[{"date_created":"2018-11-06T15:18:26Z","creator":"wever","file_id":"5384","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-11-06T15:18:26Z","file_name":"Mohr18ProgrammaticPlanning.pdf","file_size":349958,"access_level":"closed"}],"department":[{"_id":"355"}],"type":"conference","author":[{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"id":"315","first_name":"Theodor","orcid":"0000-0001-5859-2457","last_name":"Lettmann","full_name":"Lettmann, Theodor"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"},{"full_name":"Wever, Marcel Dominik","last_name":"Wever","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","id":"33176"}],"year":"2018","title":"Programmatic Task Network Planning","date_updated":"2022-01-06T06:58:08Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop08/docs/Mohr18ProgrammaticPlanning.pdf","open_access":"1"}]},{"ddc":["004"],"user_id":"477","publisher":"Springer International Publishing","_id":"2862","page":"470-490","has_accepted_license":"1","conference":{"name":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018","start_date":"2018-04-16","location":"San Francisco, CA, USA","end_date":"2018-04-20"},"status":"public","oa":"1","place":"Cham","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"citation":{"bibtex":"@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>}, booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing}, author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490} }","ama":"Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In: <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>. Cham: Springer International Publishing; 2018:470-490. doi:<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>","mla":"Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, Springer International Publishing, 2018, pp. 470–90, doi:<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>.","short":"J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing, Cham, 2018, pp. 470–490.","chicago":"Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” In <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, 470–90. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">https://doi.org/10.1007/978-3-319-76953-0_25</a>.","ieee":"J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems,” in <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, San Francisco, CA, USA, 2018, pp. 470–490.","apa":"Blömer, J., Eidens, F., &#38; Juhnke, J. (2018). Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i> (pp. 470–490). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">https://doi.org/10.1007/978-3-319-76953-0_25</a>"},"file_date_updated":"2018-11-02T13:45:40Z","doi":"10.1007/978-3-319-76953-0_25","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/029"}],"date_updated":"2022-01-06T06:58:12Z","publication_status":"published","author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"id":"25078","first_name":"Fabian","last_name":"Eidens","full_name":"Eidens, Fabian"},{"full_name":"Juhnke, Jakob","last_name":"Juhnke","first_name":"Jakob","id":"48090"}],"publication_identifier":{"isbn":["9783319769523","9783319769530"],"issn":["0302-9743","1611-3349"]},"title":"Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems","year":"2018","department":[{"_id":"7"},{"_id":"64"}],"type":"conference","date_created":"2018-05-24T11:14:02Z","file":[{"creator":"ups","date_created":"2018-11-02T13:45:40Z","date_updated":"2018-11-02T13:45:40Z","relation":"main_file","file_size":3371773,"access_level":"closed","file_name":"PracticalAnonymousAndPubliclyL.pdf","content_type":"application/pdf","success":1,"file_id":"5253"}],"publication":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings"},{"issue":"6","publication":"IEEE Transactions on Automatic Control","citation":{"apa":"Ramaswamy, A., &#38; Bhatnagar, S. (2018). Stability of stochastic approximations with “controlled markov” noise and temporal difference learning. <i>IEEE Transactions on Automatic Control</i>, <i>64</i>(6), 2614–2620.","ieee":"A. Ramaswamy and S. Bhatnagar, “Stability of stochastic approximations with ‘controlled markov’ noise and temporal difference learning,” <i>IEEE Transactions on Automatic Control</i>, vol. 64, no. 6, pp. 2614–2620, 2018.","chicago":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Stability of Stochastic Approximations with ‘Controlled Markov’ Noise and Temporal Difference Learning.” <i>IEEE Transactions on Automatic Control</i> 64, no. 6 (2018): 2614–20.","short":"A. Ramaswamy, S. Bhatnagar, IEEE Transactions on Automatic Control 64 (2018) 2614–2620.","mla":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Stability of Stochastic Approximations with ‘Controlled Markov’ Noise and Temporal Difference Learning.” <i>IEEE Transactions on Automatic Control</i>, vol. 64, no. 6, IEEE, 2018, pp. 2614–20.","ama":"Ramaswamy A, Bhatnagar S. Stability of stochastic approximations with “controlled markov” noise and temporal difference learning. <i>IEEE Transactions on Automatic Control</i>. 2018;64(6):2614-2620.","bibtex":"@article{Ramaswamy_Bhatnagar_2018, title={Stability of stochastic approximations with “controlled markov” noise and temporal difference learning}, volume={64}, number={6}, journal={IEEE Transactions on Automatic Control}, publisher={IEEE}, author={Ramaswamy, Arunselvan and Bhatnagar, Shalabh}, year={2018}, pages={2614–2620} }"},"type":"journal_article","department":[{"_id":"355"}],"date_created":"2021-09-10T10:17:54Z","date_updated":"2022-01-06T06:56:08Z","intvolume":"        64","year":"2018","status":"public","title":"Stability of stochastic approximations with “controlled markov” noise and temporal difference learning","author":[{"id":"66937","first_name":"Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","full_name":"Ramaswamy, Arunselvan"},{"full_name":"Bhatnagar, Shalabh","first_name":"Shalabh","last_name":"Bhatnagar"}],"user_id":"66937","volume":64,"page":"2614-2620","language":[{"iso":"eng"}],"_id":"24150","publisher":"IEEE"},{"author":[{"last_name":"Demirel","first_name":"Burak","full_name":"Demirel, Burak"},{"id":"66937","first_name":"Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","full_name":"Ramaswamy, Arunselvan"},{"full_name":"Quevedo, Daniel E","first_name":"Daniel E","last_name":"Quevedo"},{"full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"year":"2018","status":"public","title":"Deepcas: A deep reinforcement learning algorithm for control-aware scheduling","intvolume":"         2","date_updated":"2022-01-06T06:56:08Z","publisher":"IEEE","_id":"24151","language":[{"iso":"eng"}],"page":"737-742","volume":2,"user_id":"66937","citation":{"ama":"Demirel B, Ramaswamy A, Quevedo DE, Karl H. Deepcas: A deep reinforcement learning algorithm for control-aware scheduling. <i>IEEE Control Systems Letters</i>. 2018;2(4):737-742.","bibtex":"@article{Demirel_Ramaswamy_Quevedo_Karl_2018, title={Deepcas: A deep reinforcement learning algorithm for control-aware scheduling}, volume={2}, number={4}, journal={IEEE Control Systems Letters}, publisher={IEEE}, author={Demirel, Burak and Ramaswamy, Arunselvan and Quevedo, Daniel E and Karl, Holger}, year={2018}, pages={737–742} }","mla":"Demirel, Burak, et al. “Deepcas: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling.” <i>IEEE Control Systems Letters</i>, vol. 2, no. 4, IEEE, 2018, pp. 737–42.","chicago":"Demirel, Burak, Arunselvan Ramaswamy, Daniel E Quevedo, and Holger Karl. “Deepcas: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling.” <i>IEEE Control Systems Letters</i> 2, no. 4 (2018): 737–42.","short":"B. Demirel, A. Ramaswamy, D.E. Quevedo, H. Karl, IEEE Control Systems Letters 2 (2018) 737–742.","apa":"Demirel, B., Ramaswamy, A., Quevedo, D. E., &#38; Karl, H. (2018). Deepcas: A deep reinforcement learning algorithm for control-aware scheduling. <i>IEEE Control Systems Letters</i>, <i>2</i>(4), 737–742.","ieee":"B. Demirel, A. Ramaswamy, D. E. Quevedo, and H. Karl, “Deepcas: A deep reinforcement learning algorithm for control-aware scheduling,” <i>IEEE Control Systems Letters</i>, vol. 2, no. 4, pp. 737–742, 2018."},"issue":"4","publication":"IEEE Control Systems Letters","date_created":"2021-09-10T10:19:07Z","department":[{"_id":"355"}],"type":"journal_article"},{"user_id":"15931","_id":"24186","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:56:09Z","author":[{"first_name":"Yanfei","last_name":"Mao","full_name":"Mao, Yanfei"},{"full_name":"Shiju, E.","first_name":"E.","last_name":"Shiju"},{"full_name":"Schmalz, Klaus","last_name":"Schmalz","first_name":"Klaus"},{"id":"37144","full_name":"Scheytt, Christoph","first_name":"Christoph","last_name":"Scheytt"}],"title":"245 GHz Subharmonic Receiver With Onchip Antenna for Gas Spectroscopy Application","year":"2018","status":"public","department":[{"_id":"58"}],"type":"conference","date_created":"2021-09-13T07:37:50Z","abstract":[{"text":"A 2nd transconductance subharmonic receiver for 245 GHz spectroscopy sensor applications has been proposed. The receiver consists of a 245 GHz on-chip folded dipole antenna, a CB (common base) LNA, a 2nd transconductance SHM (subharmonic mixer), and a 120 GHz push-push VCO with 1/64 divider. The receiver is fabricated in fT/fmax = 300/500 GHz SiGe:C BiCMOS technology. The receiver dissipates a low power of 288 mW. Integrated with the on-chip antenna, the receiver is measured on-chip with a conversion gain of 15 dB, a bandwidth of 15 GHz, and the chip will be utilized in PCB board design for gas spectroscopy sensor application.","lang":"eng"}],"related_material":{"link":[{"relation":"confirmation","url":"https://iopscience.iop.org/article/10.1088/1674-4926/39/12/125001"}]},"citation":{"apa":"Mao, Y., Shiju, E., Schmalz, K., &#38; Scheytt, C. (2018). 245 GHz Subharmonic Receiver With Onchip Antenna for Gas Spectroscopy Application. <i>Journal of Semiconductors</i>.","ieee":"Y. Mao, E. Shiju, K. Schmalz, and C. Scheytt, “245 GHz Subharmonic Receiver With Onchip Antenna for Gas Spectroscopy Application,” 2018.","chicago":"Mao, Yanfei, E. Shiju, Klaus Schmalz, and Christoph Scheytt. “245 GHz Subharmonic Receiver With Onchip Antenna for Gas Spectroscopy Application.” In <i>Journal of Semiconductors</i>, 2018.","short":"Y. Mao, E. Shiju, K. Schmalz, C. Scheytt, in: Journal of Semiconductors, 2018.","mla":"Mao, Yanfei, et al. “245 GHz Subharmonic Receiver With Onchip Antenna for Gas Spectroscopy Application.” <i>Journal of Semiconductors</i>, 2018.","ama":"Mao Y, Shiju E, Schmalz K, Scheytt C. 245 GHz Subharmonic Receiver With Onchip Antenna for Gas Spectroscopy Application. In: <i>Journal of Semiconductors</i>. ; 2018.","bibtex":"@inproceedings{Mao_Shiju_Schmalz_Scheytt_2018, title={245 GHz Subharmonic Receiver With Onchip Antenna for Gas Spectroscopy Application}, booktitle={Journal of Semiconductors}, author={Mao, Yanfei and Shiju, E. and Schmalz, Klaus and Scheytt, Christoph}, year={2018} }"},"publication":"Journal of Semiconductors"},{"doi":"10.1109/ISWCS.2018.8491216","user_id":"15931","_id":"24192","language":[{"iso":"eng"}],"publisher":"IEEE","date_updated":"2022-01-06T06:56:09Z","title":"Analysis of PSSS modulation for optimization of DAC bit resolution for 100 Gbps systems","status":"public","year":"2018","conference":{"end_date":"2018.08.31","start_date":"2018.08.28","location":"Lisbon, Portugal "},"author":[{"first_name":"KrishneGowda","last_name":"Karthik","full_name":"Karthik, KrishneGowda"},{"last_name":"Wimmer","first_name":"Lara","full_name":"Wimmer, Lara"},{"first_name":"Abdul Rehman","last_name":"Javed","full_name":"Javed, Abdul Rehman"},{"last_name":"Wolf","first_name":"Andreas","full_name":"Wolf, Andreas"},{"id":"37144","last_name":"Scheytt","first_name":"Christoph","full_name":"Scheytt, Christoph"},{"full_name":"Kraemer, Rolf","last_name":"Kraemer","first_name":"Rolf"}],"type":"conference","department":[{"_id":"58"}],"place":"Portugal/Lisbon","date_created":"2021-09-13T07:37:58Z","related_material":{"link":[{"relation":"confirmation","url":"https://ieeexplore.ieee.org/document/8491216"}]},"abstract":[{"text":"The terahertz frequency range provides abundant bandwidth (25GHz ~ 50 GHz) to achieve ultra-high-speed wireless communication and enables data rates up to and above 100 Gbps. We choose Parallel Sequence Spread Spectrum (PSSS) as an analog friendly modulation and coding scheme that allows for an efficient mixed-signal implementation of a 100 Gbps wireless communication system. In our system design, we require a DAC (Digital to Analog converters) running at 1.67 G symbols/sec. The optimization of the bit resolution of this DAC will considerably reduce the hardware implementation efforts. In this work, we presented the analytical model for PSSS modulation and deduced a mathematical formula to calculate the number of discrete level amplitudes along with their probability distribution appearing at the output of the PSSS modulated signal. The analytical analysis assists in predicting the number of the quantization level of the DAC needed at the PSSS transmitter. The theoretical analysis shows that there are in total 225 discrete levels at the output of the PSSS encoder which leads to an 8-bit resolution of DAC. In this paper, we analyzed the variation of BER (Bit Error Rate) to the clipping of low probability amplitude levels and found that there is an only slight increase of the BER when we clip off the low probability amplitude levels. Thus, there is a tradeoff involved in a minor growth of BER concerning the reduction of the DAC bit resolution. Finally, we can reduce the DAC bit resolution from 8 bits to 7 bits and thus simplify the hardware implementation efforts of DAC operating at 1.67 Gbps.","lang":"eng"}],"publication":"15th International Symposium on Wireless Communication Systems (ISWCS) ","citation":{"apa":"Karthik, K., Wimmer, L., Javed, A. R., Wolf, A., Scheytt, C., &#38; Kraemer, R. (2018). Analysis of PSSS modulation for optimization of DAC bit resolution for 100 Gbps systems. <i>15th International Symposium on Wireless Communication Systems (ISWCS) </i>. <a href=\"https://doi.org/10.1109/ISWCS.2018.8491216\">https://doi.org/10.1109/ISWCS.2018.8491216</a>","mla":"Karthik, KrishneGowda, et al. “Analysis of PSSS Modulation for Optimization of DAC Bit Resolution for 100 Gbps Systems.” <i>15th International Symposium on Wireless Communication Systems (ISWCS) </i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/ISWCS.2018.8491216\">10.1109/ISWCS.2018.8491216</a>.","ieee":"K. Karthik, L. Wimmer, A. R. Javed, A. Wolf, C. Scheytt, and R. Kraemer, “Analysis of PSSS modulation for optimization of DAC bit resolution for 100 Gbps systems,” Lisbon, Portugal , 2018, doi: <a href=\"https://doi.org/10.1109/ISWCS.2018.8491216\">10.1109/ISWCS.2018.8491216</a>.","ama":"Karthik K, Wimmer L, Javed AR, Wolf A, Scheytt C, Kraemer R. Analysis of PSSS modulation for optimization of DAC bit resolution for 100 Gbps systems. In: <i>15th International Symposium on Wireless Communication Systems (ISWCS) </i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/ISWCS.2018.8491216\">10.1109/ISWCS.2018.8491216</a>","short":"K. Karthik, L. Wimmer, A.R. Javed, A. Wolf, C. Scheytt, R. Kraemer, in: 15th International Symposium on Wireless Communication Systems (ISWCS) , IEEE, Portugal/Lisbon, 2018.","chicago":"Karthik, KrishneGowda, Lara Wimmer, Abdul Rehman Javed, Andreas Wolf, Christoph Scheytt, and Rolf Kraemer. “Analysis of PSSS Modulation for Optimization of DAC Bit Resolution for 100 Gbps Systems.” In <i>15th International Symposium on Wireless Communication Systems (ISWCS) </i>. Portugal/Lisbon: IEEE, 2018. <a href=\"https://doi.org/10.1109/ISWCS.2018.8491216\">https://doi.org/10.1109/ISWCS.2018.8491216</a>.","bibtex":"@inproceedings{Karthik_Wimmer_Javed_Wolf_Scheytt_Kraemer_2018, place={Portugal/Lisbon}, title={Analysis of PSSS modulation for optimization of DAC bit resolution for 100 Gbps systems}, DOI={<a href=\"https://doi.org/10.1109/ISWCS.2018.8491216\">10.1109/ISWCS.2018.8491216</a>}, booktitle={15th International Symposium on Wireless Communication Systems (ISWCS) }, publisher={IEEE}, author={Karthik, KrishneGowda and Wimmer, Lara and Javed, Abdul Rehman and Wolf, Andreas and Scheytt, Christoph and Kraemer, Rolf}, year={2018} }"}},{"language":[{"iso":"eng"}],"_id":"24194","user_id":"15931","volume":"Presentation","year":"2018","status":"public","title":"Current and Future RISC-V Activities for Virtual Prototyping and Chip Design","author":[{"last_name":"Adelt","first_name":"Peer","full_name":"Adelt, Peer","id":"5603"},{"id":"25260","full_name":"Koppelmann, Bastian","last_name":"Koppelmann","first_name":"Bastian"},{"id":"16243","last_name":"Müller","first_name":"Wolfgang","full_name":"Müller, Wolfgang"}],"conference":{"location":"Munich, DE"},"date_updated":"2022-01-06T06:56:09Z","date_created":"2021-09-13T07:38:01Z","type":"journal_article","department":[{"_id":"58"}],"publication":"International Workshop on RISC-V Research Activities","citation":{"bibtex":"@article{Adelt_Koppelmann_Müller_2018, title={Current and Future RISC-V Activities for Virtual Prototyping and Chip Design}, volume={Presentation}, journal={International Workshop on RISC-V Research Activities}, author={Adelt, Peer and Koppelmann, Bastian and Müller, Wolfgang}, year={2018} }","chicago":"Adelt, Peer, Bastian Koppelmann, and Wolfgang Müller. “Current and Future RISC-V Activities for Virtual Prototyping and Chip Design.” <i>International Workshop on RISC-V Research Activities</i> Presentation (2018).","short":"P. Adelt, B. Koppelmann, W. Müller, International Workshop on RISC-V Research Activities Presentation (2018).","ama":"Adelt P, Koppelmann B, Müller W. Current and Future RISC-V Activities for Virtual Prototyping and Chip Design. <i>International Workshop on RISC-V Research Activities</i>. 2018;Presentation.","ieee":"P. Adelt, B. Koppelmann, and W. Müller, “Current and Future RISC-V Activities for Virtual Prototyping and Chip Design,” <i>International Workshop on RISC-V Research Activities</i>, vol. Presentation, 2018.","apa":"Adelt, P., Koppelmann, B., &#38; Müller, W. (2018). Current and Future RISC-V Activities for Virtual Prototyping and Chip Design. <i>International Workshop on RISC-V Research Activities</i>, <i>Presentation</i>.","mla":"Adelt, Peer, et al. “Current and Future RISC-V Activities for Virtual Prototyping and Chip Design.” <i>International Workshop on RISC-V Research Activities</i>, vol. Presentation, 2018."},"related_material":{"link":[{"url":"https://www.edacentrum.de/compact/current-and-future-risc-v-activities-virtual-prototyping-and-chip-design","relation":"confirmation"}]}},{"related_material":{"link":[{"relation":"confirmation","url":"https://ieeexplore.ieee.org/document/8471531"}]},"abstract":[{"text":"This paper demonstrates system level analysis of an energy efficient Radio Frequency (RF) receiver. The receiver is based on a Surface Acoustic Wave (SAW) correlator which is used for highly linear demodulation and interferer suppression in conjunction with envelope detection for ultra-low power dissipation and hardware efficiency. The receiver is to be used in Wireless Sensor Networks (WSN) as a Wake-up Receiver (WuR) to reduce the network nodes power dissipation and provide asynchronous data communication. Low latency and high interference robustness makes this scheme interesting for industrial real-time applications. In this paper, the SAW correlator transfer function is derived, which functions as a Matched Filter (MF). Since the receiver uses envelope detection and based on the characteristic of the SAW, the receiver sensitivity is analyzed by means of a non-linear approach.","lang":"eng"}],"citation":{"bibtex":"@inproceedings{Abughannam_Scheytt_2018, place={Spain/Gran Canaria/Meloneras}, title={System Analysis of a Wake-Up Receiver Based on Surface Acoustic Wave Correlator}, DOI={<a href=\"https://doi.org/10.23919/URSI-AT-RASC.2018.8471531\">10.23919/URSI-AT-RASC.2018.8471531</a>}, booktitle={2nd URSI AT-RASC}, publisher={IEEE}, author={Abughannam, Saed and Scheytt, Christoph}, year={2018}, pages={1–4} }","ama":"Abughannam S, Scheytt C. System Analysis of a Wake-Up Receiver Based on Surface Acoustic Wave Correlator. In: <i>2nd URSI AT-RASC</i>. IEEE; 2018:1-4. doi:<a href=\"https://doi.org/10.23919/URSI-AT-RASC.2018.8471531\">10.23919/URSI-AT-RASC.2018.8471531</a>","mla":"Abughannam, Saed, and Christoph Scheytt. “System Analysis of a Wake-Up Receiver Based on Surface Acoustic Wave Correlator.” <i>2nd URSI AT-RASC</i>, IEEE, 2018, pp. 1–4, doi:<a href=\"https://doi.org/10.23919/URSI-AT-RASC.2018.8471531\">10.23919/URSI-AT-RASC.2018.8471531</a>.","chicago":"Abughannam, Saed, and Christoph Scheytt. “System Analysis of a Wake-Up Receiver Based on Surface Acoustic Wave Correlator.” In <i>2nd URSI AT-RASC</i>, 1–4. Spain/Gran Canaria/Meloneras: IEEE, 2018. <a href=\"https://doi.org/10.23919/URSI-AT-RASC.2018.8471531\">https://doi.org/10.23919/URSI-AT-RASC.2018.8471531</a>.","short":"S. Abughannam, C. Scheytt, in: 2nd URSI AT-RASC, IEEE, Spain/Gran Canaria/Meloneras, 2018, pp. 1–4.","ieee":"S. Abughannam and C. Scheytt, “System Analysis of a Wake-Up Receiver Based on Surface Acoustic Wave Correlator,” in <i>2nd URSI AT-RASC</i>, 2018, pp. 1–4, doi: <a href=\"https://doi.org/10.23919/URSI-AT-RASC.2018.8471531\">10.23919/URSI-AT-RASC.2018.8471531</a>.","apa":"Abughannam, S., &#38; Scheytt, C. (2018). System Analysis of a Wake-Up Receiver Based on Surface Acoustic Wave Correlator. <i>2nd URSI AT-RASC</i>, 1–4. <a href=\"https://doi.org/10.23919/URSI-AT-RASC.2018.8471531\">https://doi.org/10.23919/URSI-AT-RASC.2018.8471531</a>"},"publication":"2nd URSI AT-RASC","department":[{"_id":"58"}],"type":"conference","date_created":"2021-09-13T07:38:02Z","place":"Spain/Gran Canaria/Meloneras","date_updated":"2022-01-06T06:56:09Z","author":[{"id":"37628","full_name":"Abughannam, Saed","last_name":"Abughannam","first_name":"Saed"},{"full_name":"Scheytt, Christoph","last_name":"Scheytt","first_name":"Christoph","id":"37144"}],"conference":{"end_date":"2018.06.01","start_date":"2018.05.28"},"year":"2018","title":"System Analysis of a Wake-Up Receiver Based on Surface Acoustic Wave Correlator","status":"public","user_id":"15931","doi":"10.23919/URSI-AT-RASC.2018.8471531","_id":"24195","language":[{"iso":"eng"}],"publisher":"IEEE","page":"1-4"},{"type":"conference","department":[{"_id":"58"}],"place":"Italy/Taormina","date_created":"2021-09-13T07:38:03Z","abstract":[{"text":"This paper presents an approach for analog fault effect simulation automation based on random fault selection with a high fault coverage of the circuit under test by means of fault injection and simulation based on advanced sampling techniques. The random fault selection utilizes the likelihood of the fault occurrence of different electrical components in the circuit with a confidence level. Defect models of different devices are analyzed for the calculation of the fault probability. A case study with our implemented tool demonstrates that likelihood calculation and fault simulation provides means for efficient fault effect simulation automation.","lang":"eng"}],"related_material":{"link":[{"relation":"confirmation","url":"https://ieeexplore.ieee.org/document/8368549"}]},"publication":"2018 13th International Conference on Design & Technology of Integrated Systems In Nanoscale Era (DTIS)) ","citation":{"mla":"Wu, Liang, et al. “Analog Fault Simulation Automation at Schematic Level with Random Sampling Techniques.” <i>2018 13th International Conference on Design &#38; Technology of Integrated Systems In Nanoscale Era (DTIS)) </i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/DTIS.2018.8368549\">10.1109/DTIS.2018.8368549</a>.","bibtex":"@inproceedings{Wu_Hussain_Abughannam_Müller_Scheytt_Ecker_2018, place={Italy/Taormina}, title={Analog fault simulation automation at schematic level with random sampling techniques}, DOI={<a href=\"https://doi.org/10.1109/DTIS.2018.8368549\">10.1109/DTIS.2018.8368549</a>}, booktitle={2018 13th International Conference on Design &#38; Technology of Integrated Systems In Nanoscale Era (DTIS)) }, publisher={IEEE}, author={Wu, Liang and Hussain, Mohammad Khizer and Abughannam, Saed and Müller, Wolfgang and Scheytt, Christoph and Ecker, Wolfgang}, year={2018} }","ama":"Wu L, Hussain MK, Abughannam S, Müller W, Scheytt C, Ecker W. Analog fault simulation automation at schematic level with random sampling techniques. In: <i>2018 13th International Conference on Design &#38; Technology of Integrated Systems In Nanoscale Era (DTIS)) </i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/DTIS.2018.8368549\">10.1109/DTIS.2018.8368549</a>","ieee":"L. Wu, M. K. Hussain, S. Abughannam, W. Müller, C. Scheytt, and W. Ecker, “Analog fault simulation automation at schematic level with random sampling techniques,” 2018, doi: <a href=\"https://doi.org/10.1109/DTIS.2018.8368549\">10.1109/DTIS.2018.8368549</a>.","apa":"Wu, L., Hussain, M. K., Abughannam, S., Müller, W., Scheytt, C., &#38; Ecker, W. (2018). Analog fault simulation automation at schematic level with random sampling techniques. <i>2018 13th International Conference on Design &#38; Technology of Integrated Systems In Nanoscale Era (DTIS)) </i>. <a href=\"https://doi.org/10.1109/DTIS.2018.8368549\">https://doi.org/10.1109/DTIS.2018.8368549</a>","short":"L. Wu, M.K. Hussain, S. Abughannam, W. Müller, C. Scheytt, W. Ecker, in: 2018 13th International Conference on Design &#38; Technology of Integrated Systems In Nanoscale Era (DTIS)) , IEEE, Italy/Taormina, 2018.","chicago":"Wu, Liang, Mohammad Khizer Hussain, Saed Abughannam, Wolfgang Müller, Christoph Scheytt, and Wolfgang Ecker. “Analog Fault Simulation Automation at Schematic Level with Random Sampling Techniques.” In <i>2018 13th International Conference on Design &#38; Technology of Integrated Systems In Nanoscale Era (DTIS)) </i>. Italy/Taormina: IEEE, 2018. <a href=\"https://doi.org/10.1109/DTIS.2018.8368549\">https://doi.org/10.1109/DTIS.2018.8368549</a>."},"doi":"10.1109/DTIS.2018.8368549","user_id":"15931","_id":"24196","language":[{"iso":"eng"}],"publisher":"IEEE","date_updated":"2022-01-06T06:56:09Z","title":"Analog fault simulation automation at schematic level with random sampling techniques","year":"2018","status":"public","conference":{"start_date":"2018.04.09","end_date":"2018.04.12"},"author":[{"full_name":"Wu, Liang","first_name":"Liang","last_name":"Wu","id":"30401"},{"full_name":"Hussain, Mohammad Khizer","last_name":"Hussain","first_name":"Mohammad Khizer"},{"id":"37628","full_name":"Abughannam, Saed","first_name":"Saed","last_name":"Abughannam"},{"full_name":"Müller, Wolfgang","last_name":"Müller","first_name":"Wolfgang","id":"16243"},{"last_name":"Scheytt","first_name":"Christoph","full_name":"Scheytt, Christoph","id":"37144"},{"full_name":"Ecker, Wolfgang","last_name":"Ecker","first_name":"Wolfgang"}]},{"application_number":"18756368","date_created":"2021-09-13T07:38:06Z","type":"patent","department":[{"_id":"58"}],"application_date":"16.07.2018","citation":{"short":"C. Scheytt, L. Wu, (2018).","chicago":"Scheytt, Christoph, and Liang Wu. “Integrier‐ Und Halte‐Schaltung ,” 2018.","ieee":"C. Scheytt and L. Wu, “Integrier‐ und Halte‐Schaltung .” 2018.","apa":"Scheytt, C., &#38; Wu, L. (2018). <i>Integrier‐ und Halte‐Schaltung </i>.","bibtex":"@article{Scheytt_Wu_2018, title={Integrier‐ und Halte‐Schaltung }, author={Scheytt, Christoph and Wu, Liang}, year={2018} }","ama":"Scheytt C, Wu L. Integrier‐ und Halte‐Schaltung . Published online 2018.","mla":"Scheytt, Christoph, and Liang Wu. <i>Integrier‐ Und Halte‐Schaltung </i>. 2018."},"related_material":{"link":[{"relation":"confirmation","url":"https://depatisnet.dpma.de/DepatisNet/depatisnet?action=bibdat&docid=EP000003656056A1"}]},"ipc":"H03K 3/42","_id":"24198","user_id":"15931","publication_date":"27.05.2020","status":"public","title":"Integrier‐ und Halte‐Schaltung ","year":"2018","author":[{"id":"37144","first_name":"Christoph","last_name":"Scheytt","full_name":"Scheytt, Christoph"},{"id":"30401","last_name":"Wu","first_name":"Liang","full_name":"Wu, Liang"}],"date_updated":"2022-01-06T06:56:09Z","ipn":"EP000003656056A1"},{"language":[{"iso":"eng"}],"_id":"24199","publisher":"IEEE","user_id":"15931","doi":"10.1109/RWS.2018.8304967","publication_identifier":{"issn":["2164-2974 "]},"author":[{"first_name":"Jan","last_name":"Wessel","full_name":"Wessel, Jan"},{"full_name":"Schmalz, Klaus","first_name":"Klaus","last_name":"Schmalz"},{"id":"37144","full_name":"Scheytt, Christoph","first_name":"Christoph","last_name":"Scheytt"},{"full_name":"Kissinger, Dietmar","first_name":"Dietmar","last_name":"Kissinger"}],"conference":{"end_date":"2018.01.18","start_date":"2018.01.15"},"status":"public","title":"Sensitive permittivity detector for dielectric samples at 120 GHz","year":"2018","date_updated":"2022-01-06T06:56:09Z","date_created":"2021-09-13T07:38:07Z","place":"USA/Anaheim","department":[{"_id":"58"}],"type":"conference","citation":{"ieee":"J. Wessel, K. Schmalz, C. Scheytt, and D. Kissinger, “Sensitive permittivity detector for dielectric samples at 120 GHz,” 2018, doi: <a href=\"https://doi.org/10.1109/RWS.2018.8304967\">10.1109/RWS.2018.8304967</a>.","mla":"Wessel, Jan, et al. “Sensitive Permittivity Detector for Dielectric Samples at 120 GHz.” <i>2018 IEEE Radio and Wireless Symposium (RWS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/RWS.2018.8304967\">10.1109/RWS.2018.8304967</a>.","apa":"Wessel, J., Schmalz, K., Scheytt, C., &#38; Kissinger, D. (2018). Sensitive permittivity detector for dielectric samples at 120 GHz. <i>2018 IEEE Radio and Wireless Symposium (RWS)</i>. <a href=\"https://doi.org/10.1109/RWS.2018.8304967\">https://doi.org/10.1109/RWS.2018.8304967</a>","bibtex":"@inproceedings{Wessel_Schmalz_Scheytt_Kissinger_2018, place={USA/Anaheim}, title={Sensitive permittivity detector for dielectric samples at 120 GHz}, DOI={<a href=\"https://doi.org/10.1109/RWS.2018.8304967\">10.1109/RWS.2018.8304967</a>}, booktitle={2018 IEEE Radio and Wireless Symposium (RWS)}, publisher={IEEE}, author={Wessel, Jan and Schmalz, Klaus and Scheytt, Christoph and Kissinger, Dietmar}, year={2018} }","ama":"Wessel J, Schmalz K, Scheytt C, Kissinger D. Sensitive permittivity detector for dielectric samples at 120 GHz. In: <i>2018 IEEE Radio and Wireless Symposium (RWS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/RWS.2018.8304967\">10.1109/RWS.2018.8304967</a>","short":"J. Wessel, K. Schmalz, C. Scheytt, D. Kissinger, in: 2018 IEEE Radio and Wireless Symposium (RWS), IEEE, USA/Anaheim, 2018.","chicago":"Wessel, Jan, Klaus Schmalz, Christoph Scheytt, and Dietmar Kissinger. “Sensitive Permittivity Detector for Dielectric Samples at 120 GHz.” In <i>2018 IEEE Radio and Wireless Symposium (RWS)</i>. USA/Anaheim: IEEE, 2018. <a href=\"https://doi.org/10.1109/RWS.2018.8304967\">https://doi.org/10.1109/RWS.2018.8304967</a>."},"publication":"2018 IEEE Radio and Wireless Symposium (RWS)","related_material":{"link":[{"relation":"confirmation","url":"https://ieeexplore.ieee.org/document/8304967"}]},"abstract":[{"lang":"eng","text":"This work describes a dielectric sensing system applying a 120 GHz electrical interferometer for contactless permittivity measurements. The applied IC was fabricated in a 130 nm SiGe process featuring an ft and fmax of 240 GHz and 330 GHz. The on-chip system contains a 120 GHz VCO with a tuning range of 7 GHz featuring a divide-by-64 circuit to enable external PLL operation. An important feature of the IC is high-precision and high-resolution phase shifting based on a slow-wave transmission lines approach with digital control. This allows for direct digital readout ability. The on chip power detector provides DC output signals giving the opportunity to record transfer functions of the interferometer. It enables sample emulation capability by phase shift inducement in the measurement as well as a reference transmission line. The motherboard of the system provides PLL stabilization for frequency sweeps. The proposed approach is capable of automated dielectric monitoring by phase compensation."}]}]