@techreport{557, abstract = {{Since the last two decades, the water consumption in Germany is decreasing, which causes the water tanks and pipes in a water supply system to work inefficiently. This paper proposes an approach for a decision support system, which helps to decide how to plan new water tanks and resize existing tanks in water supply systems. The approach uses a combination of network reduction, mathematical optimization and hydraulic simulation. The mathematical optimization model is a nonconvex Mixed Integer Quadratically Constrained Program (MIQCP), which is solved by a piecewise linearization. As this may lead to many binary variables and therefore high computational times, the size of the water supply system model is reduced before building the optimization model. By applying several network reduction techniques there may occur some hydraulic differences between the original network model and the reduced network model. To make sure that the solution obtained in the optimization process is feasible in the original water supply system, the solution is verified by a hydraulic simulation tool.}}, author = {{Hallmann, Corinna}}, publisher = {{Universität Paderborn}}, title = {{{An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation}}}, year = {{2013}}, } @inproceedings{16594, author = {{Flasskamp, Kathrin and Murphey, Todd and Ober-Blobaum, Sina}}, booktitle = {{2013 European Control Conference (ECC)}}, isbn = {{9783033039629}}, title = {{{Discretized switching time optimization problems}}}, doi = {{10.23919/ecc.2013.6669577}}, year = {{2013}}, } @article{16595, author = {{Flaßkamp, Kathrin and Murphey, Todd and Ober-Blöbaum, Sina}}, issn = {{1617-7061}}, journal = {{PAMM}}, pages = {{401--402}}, title = {{{Optimization for discretized switched systems}}}, doi = {{10.1002/pamm.201310196}}, year = {{2013}}, } @inproceedings{16643, author = {{Ober-Blöbaum, Sina and Seifried, Albert}}, booktitle = {{2013 European Control Conference (ECC)}}, isbn = {{9783033039629}}, title = {{{A multiobjective optimization approach for optimal control problems of mechanical systems with uncertainties}}}, doi = {{10.23919/ecc.2013.6669594}}, year = {{2013}}, } @inbook{16670, author = {{Schütze, Oliver and Witting, Katrin and Ober-Blöbaum, Sina and Dellnitz, Michael}}, booktitle = {{EVOLVE- A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation}}, isbn = {{9783642327254}}, issn = {{1860-949X}}, title = {{{Set Oriented Methods for the Numerical Treatment of Multiobjective Optimization Problems}}}, doi = {{10.1007/978-3-642-32726-1_5}}, year = {{2013}}, } @article{16677, author = {{Witting, Katrin and Ober-Blöbaum, Sina and Dellnitz, Michael}}, issn = {{0925-5001}}, journal = {{Journal of Global Optimization}}, pages = {{331--345}}, title = {{{A variational approach to define robustness for parametric multiobjective optimization problems}}}, doi = {{10.1007/s10898-012-9972-6}}, year = {{2013}}, } @inproceedings{15755, author = {{Busa-Fekete, Robert and Fober, T. and Hüllermeier, Eyke}}, booktitle = {{in Proceedings 23th Workshop Computational Intelligence, Dortmund Germany}}, editor = {{Hoffmann, F. and Hüllermeier, Eyke}}, pages = {{237--246}}, publisher = {{KIT Scientific Publishing}}, title = {{{Preference-based evolutionary optimization using generalized racing algorithms}}}, year = {{2013}}, } @inproceedings{15094, author = {{Böttcher, Stefan and Brandenburg, Marc and Hartel, Rita}}, booktitle = {{WEBIST 2013 - Proceedings of the 9th International Conference on Web Information Systems and Technologies}}, pages = {{137--140}}, publisher = {{SciTePress}}, title = {{{DAG - Index - A Compressed Index for XML Keyword Search}}}, year = {{2013}}, } @book{1626, author = {{Krimphove, Dieter}}, pages = {{266}}, publisher = {{Verlag Kovač}}, title = {{{"Ihr betet an, was ihr nicht kennt" (Jo 4, 22) - Eine neue Sicht auf die Trinität }}}, year = {{2013}}, } @inproceedings{16393, abstract = {{Many 3D scenes (e.g. generated from CAD data) are composed of a multitude of objects that are nested in each other. A showroom, for instance, may contain multiple cars and every car has a gearbox with many gearwheels located inside. Because the objects occlude each other, only few are visible from outside. We present a new technique, Spherical Visibility Sampling (SVS), for real-time 3D rendering of such -- possibly highly complex -- scenes. SVS exploits the occlusion and annotates hierarchically structured objects with directional visibility information in a preprocessing step. For different directions, the directional visibility encodes which objects of a scene's region are visible from the outside of the regions' enclosing bounding sphere. Since there is no need to store a separate view space subdivision as in most techniques based on preprocessed visibility, a small memory footprint is achieved. Using the directional visibility information for an interactive walkthrough, the potentially visible objects can be retrieved very efficiently without the need for further visibility tests. Our evaluation shows that using SVS allows to preprocess complex 3D scenes fast and to visualize them in real time (e.g. a Power Plant model and five animated Boeing 777 models with billions of triangles). Because SVS does not require hardware support for occlusion culling during rendering, it is even applicable for rendering large scenes on mobile devices.}}, author = {{Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}}, booktitle = {{Computer Graphics Forum}}, issn = {{0167-7055}}, number = {{4}}, pages = {{49--58}}, title = {{{Spherical Visibility Sampling}}}, doi = {{10.1111/cgf.12150}}, volume = {{32}}, year = {{2013}}, } @inbook{16406, abstract = {{In order to evaluate the efficiency of algorithms for real-time 3D rendering, different properties like rendering time, occluded triangles, or image quality, need to be investigated. Since these properties depend on the position of the camera, usually some camera path is chosen, along which the measurements are performed. As those measurements cover only a small part of the scene, this approach hardly allows drawing conclusions regarding the algorithm's properties at arbitrary positions in the scene. The presented method allows the systematic and position-independent evaluation of rendering algorithms. It uses an adaptive sampling approach to approximate the distribution of a property (like rendering time) for all positions in the scene. This approximation can be visualized to produce an intuitive impression of the algorithm's behavior or be statistically analyzed for objectively rating and comparing algorithms. We demonstrate our method by evaluating performance aspects of a known occlusion culling algorithm. }}, author = {{Jähn, Claudius and Eikel, Benjamin and Fischer, Matthias and Petring, Ralf and Meyer auf der Heide, Friedhelm}}, booktitle = {{Advances in Visual Computing}}, isbn = {{9783642419133}}, issn = {{0302-9743}}, title = {{{Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties}}}, doi = {{10.1007/978-3-642-41914-0_12}}, year = {{2013}}, } @inbook{16407, abstract = {{Many virtual 3D scenes, especially those that are large, are not structured evenly. For such heterogeneous data, there is no single algorithm that is able to render every scene type at each position fast and with the same high image quality. For a small set of scenes, this situation can be improved if different rendering algorithms are manually assigned to particular parts of the scene by an experienced user. We introduce the Multi-Algorithm-Rendering method. It automatically deploys different rendering algorithms simultaneously for a broad range of scene types. The method divides the scene into subregions and measures the behavior of different algorithms for each region in a preprocessing step. During runtime, this data is utilized to compute an estimate for the quality and running time of the available rendering algorithms from the observer's point of view. By solving an optimizing problem, the image quality can be optimized by an assignment of algorithms to regions while keeping the frame rate almost constant. }}, author = {{Petring, Ralf and Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}}, booktitle = {{Advances in Visual Computing}}, isbn = {{9783642419133}}, issn = {{0302-9743}}, title = {{{Real-Time 3D Rendering of Heterogeneous Scenes}}}, doi = {{10.1007/978-3-642-41914-0_44}}, year = {{2013}}, } @inproceedings{29966, author = {{Romaus, Christoph and Wimmelbücker, Dominik and Stille, Karl Stephan Christian and Böcker, Joachim}}, booktitle = {{2013 International Electric Machines & Drives Conference}}, publisher = {{IEEE}}, title = {{{Self-optimization energy management considering stochastic influences for a hybrid energy storage of an electric road vehicle}}}, doi = {{10.1109/iemdc.2013.6556194}}, year = {{2013}}, } @inbook{29419, author = {{Schütze, O. and Witting, K. and Ober-Blöbaum, Sina and Dellnitz, M. and Tantar, Emilia}}, booktitle = {{EVOLVE - A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation}}, pages = {{187--219}}, publisher = {{Springer}}, title = {{{Set oriented methods for the numerical treatment of multi-objective optimization problems}}}, year = {{2013}}, } @article{29406, author = {{Witting, K. and Ober-Blöbaum, Sina and Dellnitz, M.}}, journal = {{Journal of Global Optimization}}, pages = {{331--345}}, title = {{{A variational approach to define robustness for parametric multiobjective optimization problems}}}, volume = {{57(2)}}, year = {{2013}}, } @inproceedings{29443, author = {{Ober-Blöbaum, Sina and Seifried, A. }}, booktitle = {{European Control Conference}}, location = {{Zurich, Switzerland}}, pages = {{204--209}}, title = {{{A multiobjective optimization approach for optimal control problems of mechanical systems with uncertainties}}}, year = {{2013}}, } @inproceedings{29442, author = {{Flaßkamp, K. and Murphey, T. and Ober-Blöbaum, Sina}}, booktitle = {{European Control Conference}}, location = {{Zurich, Switzerland}}, pages = {{3179--3184}}, title = {{{Discretized switching time optimization problems}}}, year = {{2013}}, } @inproceedings{29490, author = {{Flaßkamp, K. and Murphey, T. and Ober-Blöbaum, Sina}}, booktitle = {{Proceedings of Applied Mathematics and Mechanics}}, pages = {{401--402}}, title = {{{Optimization for discretized switched systems}}}, volume = {{13(1)}}, year = {{2013}}, } @article{36002, author = {{Schlegel-Matthies, Kirsten and Methfessel, Barbara}}, issn = {{2193-8806}}, journal = {{Haushalt in Bidlung und Forschung}}, number = {{4}}, pages = {{49--60}}, publisher = {{Barbara Budrich}}, title = {{{Für eine veränderte Fachpraxis - Zur Kultur und Technik der Nahrungszubereitung und Mahlzeitengestaltung}}}, volume = {{2}}, year = {{2013}}, } @inbook{46385, abstract = {{In many applications one is faced with the problem that multiple objectives have to be optimized at the same time. Since typically the solution set of such multi-objective optimization problems forms a manifold which cannot be computed analytically, one is in many cases interested in a suitable finite size approximation of this set. One widely used approach is to find a representative set that maximizes the dominated hypervolume that is defined by the images in objective space of these solutions and a given reference point. In this paper, we propose a new point-wise iterative search procedure, Hypervolume Directed Search (HVDS), that aims to increase the hypervolume of a given point in an archive for bi-objective unconstrained optimization problems. We present the HVDS both as a standalone algorithm and as a local searcher within a specialized evolutionary algorithm. Numerical results confirm the strength of the novel approach.}}, author = {{Sosa, Hernández V and Schütze, O and Rudolph, G and Trautmann, Heike}}, booktitle = {{EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV}}, editor = {{Emmerich, M and Deutz, A and Schuetze, O and Bäck, T and Tantar, A and Moral, PD and Legrand, P and Bouvry, P and Coello, CA}}, isbn = {{978-3-319-01127-1}}, pages = {{189–205}}, publisher = {{Springer International Publishing}}, title = {{{The Directed Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume}}}, doi = {{10.1007/978-3-319-01128-8_13}}, volume = {{227}}, year = {{2013}}, }