{ "types" : { "Bookmark" : { "pluralLabel" : "Bookmarks" }, "Publication" : { "pluralLabel" : "Publications" }, "GoldStandardPublication" : { "pluralLabel" : "GoldStandardPublications" }, "GoldStandardBookmark" : { "pluralLabel" : "GoldStandardBookmarks" }, "Tag" : { "pluralLabel" : "Tags" }, "User" : { "pluralLabel" : "Users" }, "Group" : { "pluralLabel" : "Groups" }, "Sphere" : { "pluralLabel" : "Spheres" } }, "properties" : { "count" : { "valueType" : "number" }, "date" : { "valueType" : "date" }, "changeDate" : { "valueType" : "date" }, "url" : { "valueType" : "url" }, "id" : { "valueType" : "url" }, "tags" : { "valueType" : "item" }, "user" : { "valueType" : "item" } }, "items" : [ { "type" : "Bookmark", "id" : "https://puma.ub.uni-stuttgart.de/url/45d133726879623c3bc63fb5fd346b63/benjaminschuler", "tags" : [ "control","linear","model","nonlinear","piecewise","predictive","system","wiener" ], "intraHash" : "45d133726879623c3bc63fb5fd346b63", "label" : "A nonlinear model predictive control system based on Wiener piecewise linear models", "user" : "benjaminschuler", "description" : "", "date" : "2017-10-17 13:35:29", "changeDate" : "2017-10-17 11:35:29", "count" : 1, "url" : "http://www.sciencedirect.com/science/article/pii/S095915240200121X" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2818b7feb9e5ada9bea6c532f24b4605f/mpeltzer", "tags" : [ "adipocyte","death,","inflammation","linear","obesity,","ubiquitination," ], "intraHash" : "818b7feb9e5ada9bea6c532f24b4605f", "interHash" : "b3497b718bf29ffd0ab857f137c78248", "label" : "Linear ubiquitination prevents lipodystrophy and obesity-associated metabolic syndrome", "user" : "mpeltzer", "description" : "", "date" : "2025-11-03 13:26:59", "changeDate" : "2025-11-03 13:26:59", "count" : 1, "pub-type": "article", "journal": "Science Advances","publisher":"American Association for the Advancement of Science (AAAS)", "year": "2025", "url": "http://dx.doi.org/10.1126/sciadv.adw2539", "author": [ "Ximena Hildebrandt","Önay Veli","Armel Hyoubi","Julia Zinngrebe","Ali T. Abdallah","Julian Rodefeld","Anne Hoffmann","Liane Gardeweg","Öykü Kaya","Elena Wagner","Andreas Lindhorst","Matea Poggenberg","Yuan Wang","Joëlle Dimmler","Jutta Schillings","Pegi Koci","Francesca Bonechi","Lucas Valdez Capuccino","Christine Kiefer","Konstantinos Kelepouras","Adhideb Ghosh","Falko Noé","Christian Wolfrum","Michael Singer","Gianmaria Liccardi","Tom Luedde","Aslihan Yavas","Ahmed Ghallab","Jan G. Hengstler","Philipp Antczak","Martin Gericke","Holger Winkels","Matthias Blüher","Henning Walczak","Alessandro Annibaldi","Pamela Fischer-Posovszky","Nieves Peltzer" ], "authors": [ {"first" : "Ximena", "last" : "Hildebrandt"}, {"first" : "Önay", "last" : "Veli"}, {"first" : "Armel", "last" : "Hyoubi"}, {"first" : "Julia", "last" : "Zinngrebe"}, {"first" : "Ali T.", "last" : "Abdallah"}, {"first" : "Julian", "last" : "Rodefeld"}, {"first" : "Anne", "last" : "Hoffmann"}, {"first" : "Liane", "last" : "Gardeweg"}, {"first" : "Öykü", "last" : "Kaya"}, {"first" : "Elena", "last" : "Wagner"}, {"first" : "Andreas", "last" : "Lindhorst"}, {"first" : "Matea", "last" : "Poggenberg"}, {"first" : "Yuan", "last" : "Wang"}, {"first" : "Joëlle", "last" : "Dimmler"}, {"first" : "Jutta", "last" : "Schillings"}, {"first" : "Pegi", "last" : "Koci"}, {"first" : "Francesca", "last" : "Bonechi"}, {"first" : "Lucas Valdez", "last" : "Capuccino"}, {"first" : "Christine", "last" : "Kiefer"}, {"first" : "Konstantinos", "last" : "Kelepouras"}, {"first" : "Adhideb", "last" : "Ghosh"}, {"first" : "Falko", "last" : "Noé"}, {"first" : "Christian", "last" : "Wolfrum"}, {"first" : "Michael", "last" : "Singer"}, {"first" : "Gianmaria", "last" : "Liccardi"}, {"first" : "Tom", "last" : "Luedde"}, {"first" : "Aslihan", "last" : "Yavas"}, {"first" : "Ahmed", "last" : "Ghallab"}, {"first" : "Jan G.", "last" : "Hengstler"}, {"first" : "Philipp", "last" : "Antczak"}, {"first" : "Martin", "last" : "Gericke"}, {"first" : "Holger", "last" : "Winkels"}, {"first" : "Matthias", "last" : "Blüher"}, {"first" : "Henning", "last" : "Walczak"}, {"first" : "Alessandro", "last" : "Annibaldi"}, {"first" : "Pamela", "last" : "Fischer-Posovszky"}, {"first" : "Nieves", "last" : "Peltzer"} ], "volume": "11","number": "38", "issn" : "2375-2548", "doi" : "10.1126/sciadv.adw2539", "bibtexKey": "Hildebrandt_2025" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2089a2db9d35c2b89659284a7ae1be9c8/bjahn", "tags" : [ "energy","grids;Safety;Mixed","linear","sources;Islanding;Europe;Power","Renewable","transmission;Generators;Planning;Smart","integer","programming;Standards;Inertia;RoCof;System-Split;Generation","Expansion","Planning;MILP" ], "intraHash" : "089a2db9d35c2b89659284a7ae1be9c8", "interHash" : "a3d23d4aed0566e2d60259c2a61a4753", "label" : "Considering Disturbance Scenarios in Clustered Inertia-Aware Generation Expansion Planning", "user" : "bjahn", "description" : "", "date" : "2025-05-12 13:59:10", "changeDate" : "2025-05-12 13:59:10", "count" : 4, "pub-type": "inproceedings", "booktitle": "2024 IEEE PES Innovative Smart Grid Technologies Europe (ISGT EUROPE)", "year": "2024", "url": "", "author": [ "Oussama Alaya","Taiseer Alhaj Ali","Benedikt Jahn","Hendrik Lens" ], "authors": [ {"first" : "Oussama", "last" : "Alaya"}, {"first" : "Taiseer Alhaj", "last" : "Ali"}, {"first" : "Benedikt", "last" : "Jahn"}, {"first" : "Hendrik", "last" : "Lens"} ], "pages": "1-5", "doi" : "10.1109/ISGTEUROPE62998.2024.10863371", "bibtexKey": "10863371" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/26a5e962f82c75788dfa615ef68ed419c/slegewie", "tags" : [ "Acid,","Alternative","Analysis,","Base","Binding","Cells,","Exons,","F-H,","Group","HEK293","Heterogeneous-Nuclear","Humans,","Introns,","Kinases,","Linear","MCF-7","Mas,","Models,","Mutagenesis,","Mutation,","Neoplasms,","Nucleic","Protein-Tyrosine","Proteins,","Proto-Oncogene","RNA","RNA-Binding","Receptor","Regulatory","Ribonucleoprotein","Sequence","Sequence,","Sequences,","Sites,","Splicing," ], "intraHash" : "6a5e962f82c75788dfa615ef68ed419c", "interHash" : "e8adf17ba8666d4a803d7d7d88a2433b", "label" : "Decoding a cancer-relevant splicing decision in the RON proto-oncogene using high-throughput mutagenesis", "user" : "slegewie", "description" : "", "date" : "2025-03-05 15:52:38", "changeDate" : "2025-03-05 15:52:38", "count" : 1, "pub-type": "article", "journal": "Nature Communications", "year": "2018", "url": "", "author": [ "Simon Braun","Mihaela Enculescu","Samarth T. Setty","Mariela Cortés-López","Bernardo P. de Almeida","F. X. Reymond Sutandy","Laura Schulz","Anke Busch","Markus Seiler","Stefanie Ebersberger","Nuno L. Barbosa-Morais","Stefan Legewie","Julian König","Kathi Zarnack" ], "authors": [ {"first" : "Simon", "last" : "Braun"}, {"first" : "Mihaela", "last" : "Enculescu"}, {"first" : "Samarth T.", "last" : "Setty"}, {"first" : "Mariela", "last" : "Cortés-López"}, {"first" : "Bernardo P.", "last" : "de Almeida"}, {"first" : "F. X. Reymond", "last" : "Sutandy"}, {"first" : "Laura", "last" : "Schulz"}, {"first" : "Anke", "last" : "Busch"}, {"first" : "Markus", "last" : "Seiler"}, {"first" : "Stefanie", "last" : "Ebersberger"}, {"first" : "Nuno L.", "last" : "Barbosa-Morais"}, {"first" : "Stefan", "last" : "Legewie"}, {"first" : "Julian", "last" : "König"}, {"first" : "Kathi", "last" : "Zarnack"} ], "volume": "9","number": "1","pages": "3315","abstract": "Mutations causing aberrant splicing are frequently implicated in human diseases including cancer. Here, we establish a high-throughput screen of randomly mutated minigenes to decode the cis-regulatory landscape that determines alternative splicing of exon 11 in the proto-oncogene MST1R (RON). Mathematical modelling of splicing kinetics enables us to identify more than 1000 mutations affecting RON exon 11 skipping, which corresponds to the pathological isoform RON∆165. Importantly, the effects correlate with RON alternative splicing in cancer patients bearing the same mutations. Moreover, we highlight heterogeneous nuclear ribonucleoprotein H (HNRNPH) as a key regulator of RON splicing in healthy tissues and cancer. Using iCLIP and synergy analysis, we pinpoint the functionally most relevant HNRNPH binding sites and demonstrate how cooperative HNRNPH binding facilitates a splicing switch of RON exon 11. Our results thereby offer insights into splicing regulation and the impact of mutations on alternative splicing in cancer.", "language" : "eng", "pmid" : "30120239", "file" : "Volltext:C\\:\\\\Users\\\\SL\\\\Zotero\\\\storage\\\\29LKX6JF\\\\Braun et al. - 2018 - Decoding a cancer-relevant splicing decision in the RON proto-oncogene using high-throughput mutagen.pdf:application/pdf", "issn" : "2041-1723", "pmcid" : "PMC6098099", "doi" : "10.1038/s41467-018-05748-7", "bibtexKey": "braun_decoding_2018" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2ba8e1c52f429ef4da38846abe5f0e909/roberta.toscano", "tags" : [ "Linear","Mathematical","Mehrkriterielle","Multiple","Optimierung","Vector","criteria","decision","importzotero","making.","optimization.","spaces.","topological" ], "intraHash" : "ba8e1c52f429ef4da38846abe5f0e909", "interHash" : "35470025300f5b0fe6e4d2338e799f9b", "label" : "Vektoroptimierung: Theorie, Verfahren und Anwendungen", "user" : "roberta.toscano", "description" : "", "date" : "2024-05-27 08:58:38", "changeDate" : "2024-05-27 08:58:38", "count" : 2, "pub-type": "book", "series": "Mathematisch-naturwissenschaftliche Bibliothek ; 74","publisher":"Teubner","address":"Leipzig", "year": "1990", "url": "", "editor": [ "Alfred [Verfasser/in] Göpfert","Reinhard [Verfasser/in] Nehse" ], "editors": [ {"first" : "Alfred [Verfasser/in]", "last" : "Göpfert"}, {"first" : "Reinhard [Verfasser/in]", "last" : "Nehse"} ], "isbn" : "3-322-00755-3", "language" : "Deutsch", "bibtexKey": "gopfert_vektoroptimierung_1990" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2bd69b07ef4a55023523b3fc8b758bee4/roberta.toscano", "tags" : [ "(Statistics)","(Statistics).","Autocorrelation","Autoregression","Autoregressives","Linear","Modell.","Schätzung.","importzotero","models" ], "intraHash" : "bd69b07ef4a55023523b3fc8b758bee4", "interHash" : "3d8ef4531889ffc827b2ba0a26ba174c", "label" : "Methoden zur Schätzung der Ordnung bei autoregressiven Modellen", "user" : "roberta.toscano", "description" : "", "date" : "2024-05-27 08:58:38", "changeDate" : "2024-05-27 08:58:38", "count" : 2, "pub-type": "book", "series": "Teubner-Texte zur Mathematik ; 113","publisher":"Teubner","address":"Leipzig", "year": "1989", "url": "", "editor": [ "Hartmut [Verfasser/in] Maier" ], "editors": [ {"first" : "Hartmut [Verfasser/in]", "last" : "Maier"} ], "isbn" : "3-322-00737-5", "language" : "Deutsch", "bibtexKey": "maier_methoden_1989" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/282bc33895e569c890e8bbf7d6c8b702d/jmueller", "tags" : [ "Bemessungsverfahren,","Berechnungs-","Entwurf","FEM,","Hyperelastizität,","Klemmhalter,","Konstruktion,","Polymer-Werkstoffe,","Versuche,","Werkstoffe","clamping","hyperelasticity,","linear","materials,","nichtlineare","non","polymer","sobek","stripes,","und" ], "intraHash" : "82bc33895e569c890e8bbf7d6c8b702d", "interHash" : "3a648c7abcde7ccbab875ddcab4e8b3d", "label" : "Aspekte experimenteller und numerischer Untersuchungen von Klemmhalterungen im Glasbau", "user" : "jmueller", "description" : "", "date" : "2023-11-27 15:10:57", "changeDate" : "2023-11-27 15:10:57", "count" : 2, "pub-type": "article", "journal": "Stahlbau", "year": "2016", "url": "", "author": [ "Christian Kelleter","Michael Drass","Walter Haase","Werner Sobek","Jens Schneider" ], "authors": [ {"first" : "Christian", "last" : "Kelleter"}, {"first" : "Michael", "last" : "Drass"}, {"first" : "Walter", "last" : "Haase"}, {"first" : "Werner", "last" : "Sobek"}, {"first" : "Jens", "last" : "Schneider"} ], "volume": "85","number": "Sonderausgabe Glasbau 2016","pages": "183--195","abstract": "Klemmhaltersysteme für punktförmig gelagerte Glasfassadenelemente finden aktuell großen Anklang im Bauwesen. Konventionelle, gebohrte Verbindungstechnologien besitzen eine Kerbwirkung im Bereich der Querschnittsschwächung. Geklemmte Glasscheiben vermeiden diese Nachteile. Der Abbau von Spannungsspitzen steht hier im Vordergrund. Der kraftschlüssige Verbund ist auch gegenüber geklebten Systemen ein deutlicher Vorteil, da eine mechanische Lagesicherung stets gegeben ist. Bei der Ausführung geklemmter Verbindungen hat insbesondere das mechanische Verhalten der polymeren Zwischenlage einen wesentlichen Einfluss auf die Dimensionierung der Glasscheiben. Daher befasst sich der Beitrag mit der Charakterisierung polymerer Werkstoffe basierend auf Zug- und Druckuntersuchungen. Die experimentellen Untersuchungen dienen zur Entwicklung von hyperelastischen Materialmodellen, welche für numerische Simulationen auf Bauteilebene herangezogen werden können. Aspects of experimental and numerical studies of clamping stripes in glass constructions. Clamping fixtures for glass facade elements are actually often used in the building industry. The reason is the avoidance of drilling holes that leads to stress peaks in the glass panes. The frictional connection is an advantage compared to structural sealing glazing because there is no additional mechanical fit necessary. The thickness of the glass panels depends on the mechanical behavior of the polymer interlayer. This paper discusses the behavior of polymer materials based on tension- and compression tests for hyperelastic material models, followed by numerical simulations of structural components.", "issn" : "1437-1049", "doi" : "10.1002/stab.201690157", "bibtexKey": "kelleter_aspekte_2016" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2d9839e998f184474da256bc1270e75a0/mhutter", "tags" : [ "alloy","direct","drive","levitation","linear","magnetic","memory","shape" ], "intraHash" : "d9839e998f184474da256bc1270e75a0", "interHash" : "de605899ce1e9a9e24ce91a1a8645511", "label" : "Magnetically Levitated Linear Drive Using an Active Gravity Compensation Based on Hybrid Shape Memory Actuators", "user" : "mhutter", "description" : "", "date" : "2023-02-08 09:02:57", "changeDate" : "2023-02-08 08:02:57", "count" : 2, "pub-type": "article", "journal": "IEEE/ASME Transactions on Mechatronics", "year": "2021", "url": "", "author": [ "Markus Raab","Marco Hutter","Arif Kazi","Wolfgang Schinkoethe","Bernd Gundelsweiler" ], "authors": [ {"first" : "Markus", "last" : "Raab"}, {"first" : "Marco", "last" : "Hutter"}, {"first" : "Arif", "last" : "Kazi"}, {"first" : "Wolfgang", "last" : "Schinkoethe"}, {"first" : "Bernd", "last" : "Gundelsweiler"} ], "volume": "26","number": "3","pages": "1380-1391", "doi" : "10.1109/TMECH.2020.3019369", "bibtexKey": "9177335" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2b80ec568de1cb0962da6b4ee2b3f17c8/huebleriac", "tags" : [ "arylthiolate","bridged","crystal","dinuclear","linear","methanediphosphine","phenylphosphinomethane","platinum","prepn","structure","tolylthiolate","trinuclear","trinuclear;platinum" ], "intraHash" : "b80ec568de1cb0962da6b4ee2b3f17c8", "interHash" : "0d112e0d1754c02eefe00722b5aeed7f", "label" : "Thiolato-bridged \\dqLinear\\dq trinuclear platinum complexes [Pt3(m-SR)4(dppm)2]2+", "user" : "huebleriac", "description" : "", "date" : "2022-06-15 11:26:56", "changeDate" : "2022-06-15 09:26:56", "count" : 3, "pub-type": "article", "journal": "Inorganica Chimica Acta", "year": "2004", "url": "", "author": [ "Anshu Singhal","Vimal K. Jain","Axel Klein","Mark Niemeyer","Wolfgang. Kaim" ], "authors": [ {"first" : "Anshu", "last" : "Singhal"}, {"first" : "Vimal K.", "last" : "Jain"}, {"first" : "Axel", "last" : "Klein"}, {"first" : "Mark", "last" : "Niemeyer"}, {"first" : "Wolfgang.", "last" : "Kaim"} ], "volume": "357","number": "7","pages": "2134--2142","abstract": "Thiolato-bridged tri- and dinuclear Pt complexes [Pt3(m-SR)4(dppm)2]2+ (1) and [Pt2(m-ER)2(dppm)2]2+ (2) (E = S or Se; R = Et or aryl; dppm = bis(diphenylphosphino)methane) were prepd. using the mononuclear precursors [Pt(ER)2(dppm)]. The complexes were characterized by NMR (1H, 13C, 31P, 195Pt), FTIR and FAB mass spectral data. The structure of [Pt3(m-SC6H4CH3-4)4(dppm)2][CF3SO3]2·6CH2Cl2 (1d), was established through x-ray crystallog., revealing a zigzag arrangement of the three coordination spheres around the Pt atoms. [on SciFinder(R)]", "issn" : "0020-1693", "doi" : "10.1016/j.ica.2003.12.024", "bibtexKey": "Singhal.2004" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/20b447262b6bfbe0ef60dbbc1bd72a478/isw-bibliothek", "tags" : [ "EXC2075","SimTech","control","deformable","grk2198","isw","linear","objects","observer" ], "intraHash" : "0b447262b6bfbe0ef60dbbc1bd72a478", "interHash" : "f843e27e6620c7eab46709eae7f17b3f", "label" : "Kinematic Trajectory Following Control For Constrained Deformable Linear Objects", "user" : "isw-bibliothek", "description" : "", "date" : "2021-10-11 09:01:08", "changeDate" : "2024-02-19 12:17:54", "count" : 1, "pub-type": "inproceedings", "booktitle": "2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)", "year": "2021", "url": "", "author": [ "Manuel Zürn","Markus Wnuk","Christoph Hinze","Armin Lechler","Alexander Verl","Weiliang Xu" ], "authors": [ {"first" : "Manuel", "last" : "Zürn"}, {"first" : "Markus", "last" : "Wnuk"}, {"first" : "Christoph", "last" : "Hinze"}, {"first" : "Armin", "last" : "Lechler"}, {"first" : "Alexander", "last" : "Verl"}, {"first" : "Weiliang", "last" : "Xu"} ], "pages": "1701-1707","abstract": "deformable linear objects (DLOs) such as hoses, cables or wires are often a limiting factor in robotic manipulation. For an industrial robot control, their nonlinear dynamics combined with their large variations in material parameters make it challenging to handle. Therefore, DLOs are usually manipulated manually in the industry, offering a huge potential for automation. This paper contributes to the field of robotic handling of DLOs by presenting and evaluating a novel model based controller and observer concept which is based on a multibody simulation. The presented closed-loop framework of a kinematic trajectory following controller with an online point cloud processing observer is first evaluated separately in the simulation and then in an experiment, showing its potential for cable routing scenarios.", "issn" : "2161-8089", "doi" : "10.1109/CASE49439.2021.9551613", "bibtexKey": "9551613" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2798e2e62bd35092139fcd4b84f7ec2e5/mathematik", "tags" : [ "linear","robust","quadratic","rates","control","imng","rejection","pn4","parameters","disturbance","inequalities","stabilization","convexity","matrix","constraints","feedback","integral","output","systems","(lmis)","from:tobiasholicki","EXC310","optimization","(iqcs)","peerReviewed" ], "intraHash" : "798e2e62bd35092139fcd4b84f7ec2e5", "interHash" : "935b7ffc617413001028ab65b89dfb4d", "label" : "Robust output feedback control against disturbance filter uncertainty described by dynamic integral quadratic constraints", "user" : "mathematik", "description" : "", "date" : "2021-06-16 14:14:26", "changeDate" : "2024-03-12 10:23:40", "count" : 7, "pub-type": "article", "journal": "Int. J. Robust Nonlin.", "year": "2010", "url": "https://doi.org/10.1002/rnc.1554", "author": [ "S. G. Dietz","C. W. Scherer" ], "authors": [ {"first" : "S. G.", "last" : "Dietz"}, {"first" : "C. W.", "last" : "Scherer"} ], "volume": "20","number": "17","pages": "1903-1919","abstract": "Motivated by a robust disturbance rejection problem, in which disturbances are described by an uncertain filter at the plant input, a convex solution is presented for the robust output feedback controller synthesis problem for a particularly structured plant. The uncertainties are characterized by an integral quadratic constraint (IQC) with general frequency-dependent multipliers. By exploiting the structure of the generalized plant, linear matrix inequality (LMI)-synthesis conditions are derived in order to guarantee a specified L(2)-gain or H(2)-norm performance level, provided that the IQC multipliers are described by LMI constraints. Moreover, it is shown that part of the controller variables can be eliminated. Finally, the rejection of non-stationary sinusoidal disturbance signals is considered. In a numerical example, it is shown that specifying a bound on the rate-of-variation of the time-varying frequency can improve the performance if compared with the static IQC multipliers. Copyright (C) 2009 John Wiley & Sons, Ltd.", "shorttitle" : "Robust output feedback control against disturbance filter uncertainty described by dynamic integral quadratic constraints", "file" : "://000284215900001:Djvu", "issn" : "1049-8923", "endnotereftype" : "Journal Article", "bibtexKey": "DieSch10" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2b76e640f335c81297249449954bbaaad/danielcontreras", "tags" : [ "Aggregation","Coordination","DSO","Flexibility","Linear","Optimization","Random","Sampling","TSO","aggregation","myown" ], "intraHash" : "b76e640f335c81297249449954bbaaad", "interHash" : "91f829bf9852e4417b4dabde48ae77a8", "label" : "Verification of Linear Flexibility Range Assessment in Distribution Grids", "user" : "danielcontreras", "description" : "", "date" : "2019-07-22 14:11:12", "changeDate" : "2019-07-22 12:44:39", "count" : 2, "pub-type": "conference", "year": "2019", "url": "", "author": [ "Daniel Contreras","Krzysztof Rudion" ], "authors": [ {"first" : "Daniel", "last" : "Contreras"}, {"first" : "Krzysztof", "last" : "Rudion"} ], "abstract": "Grid operators are required to ensure the secure and stable operation of the power grid. With increasing penetration of distributed generation in the grid, especially at lower voltage levels, this task is becoming more complex for system operators, leading to the need of an improvement in their coordination efforts. To tackle this issue, different methodologies to present the flexibility provision within a distribution grid in an aggregated manner have been developed. This paper focuses on validating the results provided by such aggregation algorithms. A random sampling approach is used to validate the obtained flexibility range of a distribution grid obtained through a previously developed linear optimal power flow algorithm. By means of a \u2018beta\u2019 instead of a \u2018uniform\u2019 distribution for the selection of the random variables, the flexibility ranges become comparable and a validation of the results is applicable. A case study is performed using the CIGRE test-bench grid. Results show that optimization-based aggregation algorithms can provide accurate results, while respecting grid constraints and showing a convex behavior.", "ee" : "http://doi.acm.org/10.1145/253607.253653", "eventtitle" : "Powertech 2019", "venue" : "Milano, Italy", "eventdate" : "23-27 June 2019", "bibtexKey": "contreras2019verification" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2b80ec568de1cb0962da6b4ee2b3f17c8/b_schwederski", "tags" : [ "arylthiolate","bridged","crystal","dinuclear","linear","methanediphosphine","phenylphosphinomethane","platinum","prepn","structure","tolylthiolate","trinuclear","trinuclear;platinum" ], "intraHash" : "b80ec568de1cb0962da6b4ee2b3f17c8", "interHash" : "0d112e0d1754c02eefe00722b5aeed7f", "label" : "Thiolato-bridged \\dqLinear\\dq trinuclear platinum complexes [Pt3(m-SR)4(dppm)2]2+", "user" : "b_schwederski", "description" : "", "date" : "2019-07-15 13:41:23", "changeDate" : "2019-07-15 11:42:10", "count" : 3, "pub-type": "article", "journal": "Inorganica Chimica Acta", "year": "2004", "url": "", "author": [ "Anshu Singhal","Vimal K. Jain","Axel Klein","Mark Niemeyer","Wolfgang. Kaim" ], "authors": [ {"first" : "Anshu", "last" : "Singhal"}, {"first" : "Vimal K.", "last" : "Jain"}, {"first" : "Axel", "last" : "Klein"}, {"first" : "Mark", "last" : "Niemeyer"}, {"first" : "Wolfgang.", "last" : "Kaim"} ], "volume": "357","number": "7","pages": "2134--2142","abstract": "Thiolato-bridged tri- and dinuclear Pt complexes [Pt3(m-SR)4(dppm)2]2+ (1) and [Pt2(m-ER)2(dppm)2]2+ (2) (E = S or Se; R = Et or aryl; dppm = bis(diphenylphosphino)methane) were prepd. using the mononuclear precursors [Pt(ER)2(dppm)]. The complexes were characterized by NMR (1H, 13C, 31P, 195Pt), FTIR and FAB mass spectral data. The structure of [Pt3(m-SC6H4CH3-4)4(dppm)2][CF3SO3]2·6CH2Cl2 (1d), was established through x-ray crystallog., revealing a zigzag arrangement of the three coordination spheres around the Pt atoms. [on SciFinder(R)]", "issn" : "0020-1693", "doi" : "10.1016/j.ica.2003.12.024", "bibtexKey": "Singhal.2004" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/26577a49d6be6cb03cd99ed10f5af9860/mathematik", "tags" : [ "Adaptive","Convergence","Convexity;","FEM;","Hencky","Linear","algorithm;","elasticity;","elastoplasticity;","from:mhartmann","ians","vorlaeufig" ], "intraHash" : "6577a49d6be6cb03cd99ed10f5af9860", "interHash" : "82d27fed5937d15b2a4642665dea175f", "label" : "Convergence of Adaptive Finite Element Methods", "user" : "mathematik", "description" : "", "date" : "2018-07-20 10:54:26", "changeDate" : "2019-12-18 14:37:55", "count" : 6, "pub-type": "article", "journal": "SIAM Review", "year": "2002", "url": "http://dx.doi.org/10.1016/j.apnum.2008.12.006", "author": [ "Pedro Morin","Ricardo H. Nochetto","Kunibert G. Siebert" ], "authors": [ {"first" : "Pedro", "last" : "Morin"}, {"first" : "Ricardo H.", "last" : "Nochetto"}, {"first" : "Kunibert G.", "last" : "Siebert"} ], "volume": "44","number": "4","pages": "631-658","abstract": "The a priori convergence of finite element methods is based on the\n\tdensity property of the sequence of finite element spaces which essentially\n\tassumes a quasi-uniform mesh-refining. The advantage is guaranteed\n\tconvergence for a large class of data and solutions; the disadvantage\n\tis a global mesh refinement everywhere accompanied by large computational\n\tcosts. Adaptive finite element methods (AFEMs) automatically refine\n\texclusively wherever their refinement indication suggests to do so\n\tand consequently leave out refinements at other locations. In other\n\twords, the density property is violated on purpose and the a priori\n\tconvergence is not guaranteed automatically and, in fact, crucially\n\tdepends on algorithmic details. The advantage of AFEMs is a more\n\teffective mesh in many practical examples accompanied by smaller\n\tcomputational costs; the disadvantage is that the desirable convergence\n\tproperty is not guaranteed a priori. Efficient error estimators can\n\tjustify a numerical approximation a posteriori and so achieve reliability.\n\tBut it is not theoretically justified from the start that the adaptive\n\tmesh-refinement will generate an accurate solution at all. In order\n\tto foster the development of a convergence theory and improved design\n\tof AFEMs in computational engineering and sciences, this paper describes\n\ta particular version of an AFEM and analyses convergence results\n\tfor three model problems in computational mechanics: linear elastic\n\tmaterial (A), nonlinear monotone elastic material (B), and Hencky\n\telastoplastic material (C). It establishes conditions sufficient\n\tfor error-reduction in (A), for energy-reduction in (B), and eventually\n\tfor strong convergence of the stress field in (C) in the presence\n\tof small hardening.", "owner" : "kohlsk", "doi" : "10.1016/j.apnum.2008.12.006", "bibtexKey": "morin2002convergence" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/26577a49d6be6cb03cd99ed10f5af9860/mhartmann", "tags" : [ "Adaptive","Convergence","Convexity;","FEM;","Hencky","Linear","algorithm;","elasticity;","elastoplasticity;","vorlaeufig" ], "intraHash" : "6577a49d6be6cb03cd99ed10f5af9860", "interHash" : "82d27fed5937d15b2a4642665dea175f", "label" : "Convergence of Adaptive Finite Element Methods", "user" : "mhartmann", "description" : "", "date" : "2018-07-20 10:54:15", "changeDate" : "2018-07-20 08:54:15", "count" : 6, "pub-type": "article", "journal": "SIAM Review", "year": "2002", "url": "http://dx.doi.org/10.1016/j.apnum.2008.12.006", "author": [ "Pedro Morin","Ricardo H. Nochetto","Kunibert G. Siebert" ], "authors": [ {"first" : "Pedro", "last" : "Morin"}, {"first" : "Ricardo H.", "last" : "Nochetto"}, {"first" : "Kunibert G.", "last" : "Siebert"} ], "volume": "44","number": "4","pages": "631-658","abstract": "The a priori convergence of finite element methods is based on the\n\tdensity property of the sequence of finite element spaces which essentially\n\tassumes a quasi-uniform mesh-refining. The advantage is guaranteed\n\tconvergence for a large class of data and solutions; the disadvantage\n\tis a global mesh refinement everywhere accompanied by large computational\n\tcosts. Adaptive finite element methods (AFEMs) automatically refine\n\texclusively wherever their refinement indication suggests to do so\n\tand consequently leave out refinements at other locations. In other\n\twords, the density property is violated on purpose and the a priori\n\tconvergence is not guaranteed automatically and, in fact, crucially\n\tdepends on algorithmic details. The advantage of AFEMs is a more\n\teffective mesh in many practical examples accompanied by smaller\n\tcomputational costs; the disadvantage is that the desirable convergence\n\tproperty is not guaranteed a priori. Efficient error estimators can\n\tjustify a numerical approximation a posteriori and so achieve reliability.\n\tBut it is not theoretically justified from the start that the adaptive\n\tmesh-refinement will generate an accurate solution at all. In order\n\tto foster the development of a convergence theory and improved design\n\tof AFEMs in computational engineering and sciences, this paper describes\n\ta particular version of an AFEM and analyses convergence results\n\tfor three model problems in computational mechanics: linear elastic\n\tmaterial (A), nonlinear monotone elastic material (B), and Hencky\n\telastoplastic material (C). It establishes conditions sufficient\n\tfor error-reduction in (A), for energy-reduction in (B), and eventually\n\tfor strong convergence of the stress field in (C) in the presence\n\tof small hardening.", "owner" : "kohlsk", "doi" : "10.1016/j.apnum.2008.12.006", "bibtexKey": "morin2002convergence" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/278feed56c1636b8fcbfd657450c145bd/clausbraun", "tags" : [ "ABFT","GPGPU","GPU","SimTech","algebra","algorithm-based","error","error-detection","fault","fault-tolerance","linear","matrix-operations","myown","simulation" ], "intraHash" : "78feed56c1636b8fcbfd657450c145bd", "interHash" : "f4aa6bff08e99d1685a2218270cadc80", "label" : "Algorithm-based fault tolerance for matrix operations on graphics processing units: analysis and extension to autonomous operation.", "user" : "clausbraun", "description" : "", "date" : "2018-03-19 16:42:05", "changeDate" : "2018-03-19 15:42:05", "count" : 3, "pub-type": "phdthesis", "year": "2015", "url": "", "author": [ "Claus Braun" ], "authors": [ {"first" : "Claus", "last" : "Braun"} ], "ee" : "http://d-nb.info/1075190916", "bibtexKey": "phd/dnb/Braun15" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2a6dcd392b900956871dd3cfde89cd481/clausbraun", "tags" : [ "ABFT","GPGPU","GPU","SimTech","adaptivity","algebra","algorithm-based","autonompous","error","error-correction","error-detection","fault-tolerance","linear","matrix","matrix-multiplication","metric","myown","rounding","rounding-error" ], "intraHash" : "a6dcd392b900956871dd3cfde89cd481", "interHash" : "f672f35af5f6b825bda005ca703be294", "label" : "A-ABFT: Autonomous Algorithm-Based Fault Tolerance for Matrix Multiplications on Graphics Processing Units", "user" : "clausbraun", "description" : "", "date" : "2018-03-19 16:15:07", "changeDate" : "2018-03-19 15:37:08", "count" : 7, "pub-type": "inproceedings", "booktitle": "Proceedings of the 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'14)", "year": "2014", "url": "", "author": [ "Claus Braun","Sebastian Halder","Hans-Joachim Wunderlich" ], "authors": [ {"first" : "Claus", "last" : "Braun"}, {"first" : "Sebastian", "last" : "Halder"}, {"first" : "Hans-Joachim", "last" : "Wunderlich"} ], "pages": "443--454","abstract": "Graphics processing units (GPUs) enable large-scale scientific applications and simulations on the desktop. To allow scientific computing on GPUs with high performance and reliability requirements, the application of software-based fault tolerance is attractive. Algorithm-Based Fault Tolerance (ABFT) protects important scientific operations like matrix multiplications. However, the application to floating-point operations necessitates the runtime classification of errors into inevitable rounding errors, allowed compute errors in the magnitude of such rounding errors, and into critical errors that are larger than those and not tolerable. Hence, an ABFT scheme needs suitable rounding error bounds to detect errors reliably. The determination of such error bounds is a highly challenging task, especially since it has to be integrated tightly into the algorithm and executed autonomously with low performance overhead.\r\n In this work, A-ABFT for matrix multiplications on GPUs is introduced, which is a new, parallel ABFT scheme that determines rounding error bounds autonomously at runtime with low performance overhead and high error coverage.", "file" : "http://www.iti.uni-stuttgart.de/fileadmin/rami/files/publications/2014/DSN_BraunHH2014.pdf", "doi" : "http://dx.doi.org/10.1109/DSN.2014.48", "bibtexKey": "BraunHW2014" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/28b341984a107175be05eebdda39e6c12/clausbraun", "tags" : [ "AxC","CCG","PCG","SimTech","approximate","computing","conjugate","error-correction","error-detection","fault-tolerance","gradient","linear","myown","preconditioned","solver","sparse","systems" ], "intraHash" : "8b341984a107175be05eebdda39e6c12", "interHash" : "819e882fc0ec03e0c6e332411bfbf42d", "label" : "Applying Efficient Fault Tolerance to Enable the Preconditioned Conjugate Gradient Solver on Approximate Computing Hardware", "user" : "clausbraun", "description" : "", "date" : "2018-03-19 16:15:07", "changeDate" : "2018-03-19 15:34:51", "count" : 6, "pub-type": "inproceedings", "booktitle": "Proceedings of the IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT'16)", "year": "2016", "url": "", "author": [ "Alexander Schöll","Claus Braun","Hans-Joachim Wunderlich" ], "authors": [ {"first" : "Alexander", "last" : "Schöll"}, {"first" : "Claus", "last" : "Braun"}, {"first" : "Hans-Joachim", "last" : "Wunderlich"} ], "pages": "21-26","abstract": "A new technique is presented that allows to execute the preconditioned conjugate gradient (PCG) solver on approximate hardware while ensuring correct solver results. This technique expands the scope of approximate computing to scientific and engineering applications. The changing error resilience of PCG during the solving process is exploited by different levels of approximation which trade off numerical accuracy and hardware utilization. Such approximation levels are determined at runtime by periodically estimating the error resilience. An efficient fault tolerance technique allows reductions in hardware utilization by ensuring the continued exploitation of maximum allowed energy-accuracy trade-offs. Experimental results show that the hardware utilization is reduced on average by 14.5% and by up to 41.0% compared to executing PCG on accurate hardware.", "file" : "http://www.iti.uni-stuttgart.de/fileadmin/rami/files/publications/2016/DFT_SchoeBW2016.pdf", "doi" : "http://dx.doi.org/10.1109/DFT.2016.7684063", "bibtexKey": "SchoeBW2016" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/28c90a682adda1e125eb007f0c70bd70a/clausbraun", "tags" : [ "ABFT","CG","PCG","SimTech","conjugate","error","error-correction","error-detection","fault","fault-tolerance","gradient","linear","myown","preconditioned","solver","sparse","system" ], "intraHash" : "8c90a682adda1e125eb007f0c70bd70a", "interHash" : "d133c0d9eda7017c266a9d01721a9c91", "label" : "Low-Overhead Fault-Tolerance for the Preconditioned Conjugate Gradient Solver", "user" : "clausbraun", "description" : "", "date" : "2018-03-19 16:15:07", "changeDate" : "2018-03-19 15:33:36", "count" : 6, "pub-type": "inproceedings", "booktitle": "Proceedings of the International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT'15)", "year": "2015", "url": "", "author": [ "Alexander Schöll","Claus Braun","Michael A. Kochte","Hans-Joachim Wunderlich" ], "authors": [ {"first" : "Alexander", "last" : "Schöll"}, {"first" : "Claus", "last" : "Braun"}, {"first" : "Michael A.", "last" : "Kochte"}, {"first" : "Hans-Joachim", "last" : "Wunderlich"} ], "pages": "60-65","abstract": "Linear system solvers are an integral part for many different compute-intensive applications and they benefit from the compute power of heterogeneous computer architectures. However, the growing spectrum of reliability threats for such nano-scaled CMOS devices makes the integration of fault tolerance mandatory. The preconditioned conjugate gradient (PCG) method is one widely used solver as it finds solutions typically faster compared to direct methods. Although this iterative approach is able to tolerate certain errors, latest research shows that the PCG solver is still vulnerable to transient effects. Even single errors, for instance, caused by marginal hardware, harsh environments, or particle radiation, can considerably affect execution times, or lead to silent data corruption. In this work, a novel fault-tolerant PCG solver with extremely low runtime overhead is proposed. Since the error detection method does not involve expensive operations, it scales very well with increasing problem sizes. In case of errors, the method selects between three different correction methods according to the identified error. Experimental results show a runtime overhead for error detection ranging only from 0.04% to 1.70%.", "file" : "http://www.iti.uni-stuttgart.de/fileadmin/rami/files/publications/2015/DFTS_SchoeBKW2015.pdf", "doi" : "http://dx.doi.org/10.1109/DFT.2015.7315136", "bibtexKey": "SchoeBKW2015a" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/27e5f4629e5616459c867bc30d3893e78/clausbraun", "tags" : [ "ABFT","CG","PCG","SimTech","conjugate","efficiency","fault","fault-tolerance","gradient","linear","myown","preconditioned","solver","sparse" ], "intraHash" : "7e5f4629e5616459c867bc30d3893e78", "interHash" : "7911878633d0e9fce50d136187cf87a4", "label" : "Efficient On-Line Fault-Tolerance for the Preconditioned Conjugate Gradient Method", "user" : "clausbraun", "description" : "", "date" : "2018-03-19 16:15:07", "changeDate" : "2018-03-19 15:30:49", "count" : 6, "pub-type": "inproceedings", "booktitle": "Proceedings of the 21st IEEE International On-Line Testing Symposium (IOLTS'15)", "year": "2015", "url": "", "author": [ "Alexander Schöll","Claus Braun","Michael A. Kochte","Hans-Joachim Wunderlich" ], "authors": [ {"first" : "Alexander", "last" : "Schöll"}, {"first" : "Claus", "last" : "Braun"}, {"first" : "Michael A.", "last" : "Kochte"}, {"first" : "Hans-Joachim", "last" : "Wunderlich"} ], "pages": "95--100","abstract": "Linear system solvers are key components of many scientific applications and they can benefit significantly from modern heterogeneous computer architectures. However, such nano-scaled CMOS devices face an increasing number of reliability threats, which make the integration of fault tolerance mandatory. The preconditioned conjugate gradient method (PCG) is a very popular solver since it typically finds solutions faster than direct methods, and it is less vulnerable to transient effects. However, as latest research shows, the vulnerability is still considerable. Even single errors caused, for instance, by marginal hardware, harsh operating conditions or particle radiation can increase execution times considerably or corrupt solutions without indication. In this work, a novel and highly efficient fault-tolerant PCG method is presented. The method applies only two inner products to reliably detect errors. In case of errors, the method automatically selects between roll-back and efficient on-line correction. This significantly reduces the error detection overhead and expensive re-computations.", "file" : "http://www.iti.uni-stuttgart.de/fileadmin/rami/files/publications/2015/IOLTS_SchoeBKW2015.pdf", "doi" : "http://dx.doi.org/10.1109/IOLTS.2015.7229839", "bibtexKey": "SchoeBKW2015" } , { "type" : "Publication", "id" : "https://puma.ub.uni-stuttgart.de/bibtex/2973313fa8f49996637b903eadac4fc19/clausbraun", "tags" : [ "ABFT","SimTech","algebra","error-detection","fault-tolerance","linear","localization","myown","online","sparse" ], "intraHash" : "973313fa8f49996637b903eadac4fc19", "interHash" : "3e8ca3c5bdad028a00edd6b200f98b53", "label" : "Efficient Algorithm-Based Fault Tolerance for Sparse Matrix Operations", "user" : "clausbraun", "description" : "", "date" : "2018-03-19 16:15:07", "changeDate" : "2018-03-19 15:26:03", "count" : 6, "pub-type": "inproceedings", "booktitle": "Proceedings of the 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'16)", "year": "2016", "url": "", "author": [ "Alexander Schöll","Claus Braun","Michael A. Kochte","Hans-Joachim Wunderlich" ], "authors": [ {"first" : "Alexander", "last" : "Schöll"}, {"first" : "Claus", "last" : "Braun"}, {"first" : "Michael A.", "last" : "Kochte"}, {"first" : "Hans-Joachim", "last" : "Wunderlich"} ], "pages": "251--262","abstract": "We propose a fault tolerance approach for sparse matrix operations that detects and implicitly locates errors in the results for efficient local correction. This approach reduces the runtime overhead for fault tolerance and provides high error coverage. Existing algorithm-based fault tolerance approaches for sparse matrix operations detect and correct errors, but they often rely on expensive error localization steps. General checkpointing schemes can induce large recovery cost for high error rates. For sparse matrix-vector multiplications, experimental results show an average reduction in runtime overhead of 43.8%, while the error coverage is on average improved by 52.2% compared to related work. The practical applicability is demonstrated in a case study using the iterative Preconditioned Conjugate Gradient solver. When scaling the error rate by four orders of magnitude, the average runtime overhead increases only by 31.3% compared to low error rates.", "file" : "http://www.iti.uni-stuttgart.de/fileadmin/rami/files/publications/2016/DSN_SchoeBKW2016.pdf", "doi" : "http://dx.doi.org/10.1109/DSN.2016.31", "bibtexKey": "SchoeBKW2016" } ] }