http://www.tu-ilmenau.de

Logo TU Ilmenau



Photo of the Contact Person
Contact Person

Prof. Dr. Michael Stiebitz

Head of Institute

Phone +49 3677 69-3633

Send email


INHALTE

Publications

Publications at the institute since 1990

Anzahl der Treffer: 1176
Erstellt: Tue, 18 Feb 2020 23:08:06 +0100 in 0.0815 sec


Sukjit, Panchalee; Kubek, Mario; Böhme, Thomas; Unger, Herwig;
PDSearch: using pictures as queries. - In: Recent advances in information and communication technology : proceedings of the 10th International Conference on Computing and Information Technology (IC2IT2014).. - Cham : Springer International Publishing, (2014), S. 255-262

http://dx.doi.org/10.1007/978-3-319-06538-0_25
Bang-Jensen, Jørgen; Kriesell, Matthias; Maddaloni, Alessandro; Simonsen, Sven;
Vertex-disjoint directed and undirected cycles in general digraphs. - In: Journal of combinatorial theory. . - Orlando, Fla. : Academic Press, 1971- ; ZDB-ID: 1469158-9, Bd. 106 (2014), S. 1-14

http://dx.doi.org/10.1016/j.jctb.2013.10.005
Reis, Timo; Selig, Tilman;
Funnel control for the boundary controlled heat equation. - Hamburg : Fachbereich Mathematik, Universität Hamburg, 2014. - 1 Online-Ressource (33 Seiten, 264 MB). . - (Hamburger Beiträge zur Angewandten Mathematik. - 2014,13)
https://edocs.tib.eu/files/e01fn16/866296891.pdf
Berger, Thomas; Ilchmann, Achim; Reis, Timo;
Funnel control for nonlinear functional differential-algebraic systems. - In: MTNS 2014. - Groningen : Univ. of Groningen, ISBN 978-90-367-6321-9, 2014, Paper MoA02.4, insges. 7 S.

Boccia, Andrea; Grüne, Lars; Worthmann, Karl;
Stability and feasibility of state-constrained linear MPC without stabilizing terminal constraints. - In: MTNS 2014. - Groningen : Univ. of Groningen, ISBN 978-90-367-6321-9, 2014, Paper TuA07.4, insges. 8 S.

Miltzow, Tillmann; Schmidt, Jens M.; Xia, Mingji
Counting K 4 -subdivisions. - In: De.arxiv.org. - [S.l.] : Arxiv.org, (2014), insges. 11 S.

http://arxiv.org/abs/1411.4819
Fabrici, Igor; Jendrol', Stanislav; Harant, Jochen; Soták, Roman
A note on vertex colorings of plane graphs. - In: Discussiones mathematicae. - Warsaw : De Gruyter Open, ISSN 2083-5892, Bd. 34 (2014), 4, S. 849-855

https://doi.org/10.7151/dmgt.1771
Römer, Florian; Lavrenko, Anastasia; Del Galdo, Giovanni; Hotz, Thomas; Arikan, Orhan; Thomä, Reiner S.
Sparsity order estimation for single snapshot compressed sensing. - In: 48th Asilomar Conference on Signals, Systems and Computers, 2014 : 2 - 5 Nov. 2014, Pacific Grove, California.. - Piscataway, NJ : IEEE, ISBN 978-1-4799-8298-1, (2014), S. 1220-1224

http://dx.doi.org/10.1109/ACSSC.2014.7094653
Eichfelder, Gabriele;
Vector optimization in medical engineering. - In: Mathematics without boundaries. - New York [u.a.] : Springer, ISBN 978-1-4939-1123-3, (2014), S. 181-215

This chapter is on the theory and numerical procedures of vector optimization w.r.t. various ordering structures, on recent developments in this area and, most important, on their application to medical engineering. In vector optimization one considers optimization problems with a vector-valued objective map and thus one has to compare elements in a linear space. If the linear space is the finite dimensional space Rm this can be done componentwise. That corresponds to the notion of an EdgeworthPareto optimal solution of a multiobjective optimization problem. Among the multitude of applications which can be modeled by such a multiobjective optimization problem, we present an application in intensity modulated radiation therapy and its solution by a numerical procedure. In case the linear space is arbitrary, maybe infinite dimensional, one may introduce a partial ordering which defines how elements are compared. Such problems arise for instance in magnetic resonance tomography where the number of Hermitian matrices which have to be considered for a control of the maximum local specific absorption rate can be reduced by applying procedures from vector optimization. In addition to a short introduction and the application problem, we present a numerical solution method for solving such vector optimization problems. A partial ordering can be represented by a convex cone which describes the set of directions in which one assumes that the current values are deteriorated. If one assumes that this set may vary dependently on the actually considered element in the linear space, one may replace the partial ordering by a variable ordering structure. This was for instance done in an application in medical image registration. We present a possibility of how to model such variable ordering structures mathematically and how optimality can be defined in such a case. We also give a numerical solution method for the case of a finite set of alternatives.



Doerr, Carola; Ramakrishna, G.; ,
Computing minimum cycle bases in weighted partial 2-trees in linear time. - In: Journal of graph algorithms and applications : JGAA.. - [S.l.], ISSN 15261719, Bd. 18 (2014), 3, S. 325-346

https://doi.org/10.7155/jgaa.00325