@article{27521, author = {{Hebebrand, Johannes and Milos, Gabriella and Wabitsch, Martin and Teufel, Martin and Führer, Dagmar and Bühlmeier, Judith and Libuda, Lars and Ludwig, Christine and Antel, Jochen}}, issn = {{1664-1078}}, journal = {{Frontiers in Psychology}}, title = {{{Clinical Trials Required to Assess Potential Benefits and Side Effects of Treatment of Patients With Anorexia Nervosa With Recombinant Human Leptin}}}, doi = {{10.3389/fpsyg.2019.00769}}, year = {{2019}}, } @article{47947, author = {{Rüsing, Michael and Weigel, Peter O. and Zhao, Jie and Mookherjea, Shayan}}, issn = {{1932-4510}}, journal = {{IEEE Nanotechnology Magazine}}, keywords = {{Electrical and Electronic Engineering, Mechanical Engineering}}, number = {{4}}, pages = {{18--33}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Toward 3D Integrated Photonics Including Lithium Niobate Thin Films: A Bridge Between Electronics, Radio Frequency, and Optical Technology}}}, doi = {{10.1109/mnano.2019.2916115}}, volume = {{13}}, year = {{2019}}, } @inproceedings{46343, abstract = {{This paper addresses multimodality of multi-objective (MO) optimization landscapes. Contrary to common perception of local optima, according to which they are hindering the progress of optimization algorithms, it will be shown that local efficient sets in a multi-objective setting can assist optimizers in finding global efficient sets. We use sophisticated visualization techniques, which rely on gradient field heatmaps, to highlight those insights into landscape characteristics. Finally, the MO local optimizer MOGSA is introduced, which exploits those observations by sliding down the multi-objective gradient hill and moving along the local efficient sets.}}, author = {{Grimme, Christian and Kerschke, Pascal and Trautmann, Heike}}, booktitle = {{Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO)}}, editor = {{Deb, Kalyanmoy and Goodman, Erik and Coello, Coello Carlos A. and Klamroth, Kathrin and Miettinen, Kaisa and Mostaghim, Sanaz and Reed, Patrick}}, pages = {{126–138}}, publisher = {{Springer}}, title = {{{Multimodality in Multi-Objective Optimization — More Boon than Bane?}}}, doi = {{10.1007/978-3-030-12598-1_11}}, volume = {{11411}}, year = {{2019}}, } @inproceedings{46342, abstract = {{There is a range of phenomena in continuous, global multi-objective optimization, that cannot occur in single-objective optimization. For instance, in some multi-objective optimization problems it is possible to follow continuous paths of gradients of straightforward weighted scalarization functions, starting from locally efficient solutions, in order to reach globally Pareto optimal solutions. This paper seeks to better characterize multimodal multi-objective landscapes and to better understand the transitions from local optima to global optima in simple, path-oriented search procedures.}}, author = {{Grimme, Christian and Kerschke, Pascal and Emmerich, Michael T M and Preuss, Mike and Deutz, André H and Trautmann, Heike}}, booktitle = {{AIP Conference Proceedings}}, pages = {{020052--1--020052--4}}, publisher = {{AIP Publishing}}, title = {{{Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization}}}, doi = {{10.1063/1.5090019}}, year = {{2019}}, } @inbook{48341, author = {{Wille, Manuel}}, booktitle = {{Textgliederungsprinzipien. Ihre Kennzeichnungsformen und Funktionen vom 8. bis 18. Jahrhundert. Akten zum Internationalen Kongress vom 22. bis 24. Juni 2017 an der Universität St. Petersburg}}, editor = {{Simmler, Franz and Baeva, Galina}}, pages = {{507 -- 531}}, publisher = {{Weidler}}, title = {{{Prinzipien und Strategien der Textgliederung in den Zeitungen des 18. Jahrhunderts – Eine computerbasierte Korpusanalyse}}}, volume = {{34}}, year = {{2019}}, } @inbook{31142, author = {{Schuster, Britt-Marie}}, booktitle = {{Textgliederungsprinzipien. Ihre Kennzeichnungsformen und Funktionen in Texten vom 8. bis 18. Jahrhundert. Akten zum Internationalen Kongress an der Staatlichen Universität St. Petersburg vom 22. bis 24. Juni 2017}}, editor = {{Simmler, Franz and Baeva, Galina}}, keywords = {{Textsortengeschichte}}, pages = {{293–312}}, publisher = {{WEIDLER}}, title = {{{Textgliederungsprinzipien und Beziehungsgestaltung im Stammbuch von 1559–1878}}}, year = {{2019}}, } @inbook{46336, abstract = {{Choosing the best-performing optimizer(s) out of a portfolio of optimization algorithms is usually a difficult and complex task. It gets even worse, if the underlying functions are unknown, i.e., so-called black-box problems, and function evaluations are considered to be expensive. In case of continuous single-objective optimization problems, exploratory landscape analysis (ELA), a sophisticated and effective approach for characterizing the landscapes of such problems by means of numerical values before actually performing the optimization task itself, is advantageous. Unfortunately, until now it has been quite complicated to compute multiple ELA features simultaneously, as the corresponding code has been—if at all—spread across multiple platforms or at least across several packages within these platforms. This article presents a broad summary of existing ELA approaches and introduces flacco, an R-package for feature-based landscape analysis of continuous and constrained optimization problems. Although its functions neither solve the optimization problem itself nor the related algorithm selection problem (ASP), it offers easy access to an essential ingredient of the ASP by providing a wide collection of ELA features on a single platform—even within a single package. In addition, flacco provides multiple visualization techniques, which enhance the understanding of some of these numerical features, and thereby make certain landscape properties more comprehensible. On top of that, we will introduce the package’s built-in, as well as web-hosted and hence platform-independent, graphical user interface (GUI). It facilitates the usage of the package—especially for people who are not familiar with R—and thus makes flacco a very convenient toolbox when working towards algorithm selection of continuous single-objective optimization problems.}}, author = {{Kerschke, Pascal and Trautmann, Heike}}, booktitle = {{Applications in Statistical Computing}}, editor = {{Bauer, Nadja and Ickstadt, Katja and Lübke, Karsten and Szepannek, Gero and Trautmann, Heike and Vichi, Maurizio}}, pages = {{93–123}}, publisher = {{Springer}}, title = {{{Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-package flacco}}}, doi = {{10.1007/978-3-030-25147-5_7}}, year = {{2019}}, } @article{46346, abstract = {{In this article, we build upon previous work on designing informative and efficient Exploratory Landscape Analysis features for characterizing problems' landscapes and show their effectiveness in automatically constructing algorithm selection models in continuous black-box optimization problems. Focusing on algorithm performance results of the COCO platform of several years, we construct a representative set of high-performing complementary solvers and present an algorithm selection model that, compared to the portfolio's single best solver, on average requires less than half of the resources for solving a given problem. Therefore, there is a huge gain in efficiency compared to classical ensemble methods combined with an increased insight into problem characteristics and algorithm properties by using informative features. The model acts on the assumption that the function set of the Black-Box Optimization Benchmark is representative enough for practical applications. The model allows for selecting the best suited optimization algorithm within the considered set for unseen problems prior to the optimization itself based on a small sample of function evaluations. Note that such a sample can even be reused for the initial population of an evolutionary (optimization) algorithm so that even the feature costs become negligible.}}, author = {{Kerschke, Pascal and Trautmann, Heike}}, journal = {{Evolutionary Computation (ECJ)}}, number = {{1}}, pages = {{99–127}}, title = {{{Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning}}}, doi = {{10.1162/evco_a_00236}}, volume = {{27}}, year = {{2019}}, } @article{46347, abstract = {{We continue recent work on the definition of multimodality in multiobjective optimization (MO) and the introduction of a test bed for multimodal MO problems. This goes beyond well-known diversity maintenance approaches but instead focuses on the landscape topology induced by the objective functions. More general multimodal MO problems are considered by allowing ellipsoid contours for single-objective subproblems. An experimental analysis compares two MO algorithms, one that explicitly relies on hypervolume gradient approximation, and one that is based on local search, both on a selection of generated example problems. We do not focus on performance but on the interaction induced by the problems and algorithms, which can be described by means of specific characteristics explicitly designed for the multimodal MO setting. Furthermore, we widen the scope of our analysis by additionally applying visualization techniques in the decision space. This strengthens and extends the foundations for Exploratory Landscape Analysis (ELA) in MO.}}, author = {{Kerschke, Pascal and Wang, Hao and Preuss, Mike and Grimme, Christian and Deutz, André and Trautmann, Heike and Emmerich, Michael}}, journal = {{Evolutionary Computation (ECJ)}}, number = {{4}}, pages = {{577–609}}, title = {{{Search Dynamics on Multimodal Multi-Objective Problems}}}, doi = {{10.1162/evco_a_00234}}, volume = {{27}}, year = {{2019}}, } @inproceedings{23720, abstract = {{Die Instandsetzung von sicherheitskritischen Komponenten durch Besatzungsmitglieder auf See erfordert technische und organisa-torische Unterstützungsmaßnahmen. Zur Instandsetzung kritischer Systeme auf See bietet AR-Technologie erkennbare Potenziale (Räumliche Visualisierung, Kontextualisierung). Zugleich sollen Instandsetzungs-Einsätze im Sinne des informellen arbeits- und einsatzbezogenen Lernens zum Kompetenzerwerb genutzt werden. Dazu wird eine AR-Architektur vorgestellt, die das Lernen im Anwendungsfall ‚Instandsetzung‘ integriert.}}, author = {{Gräßler, Iris and Pottebaum, Jens and Taplick, Patrick and Roesmann, Daniel and Preuß, Daniel}}, booktitle = {{Go-3D 2019 "Mit 3D Richtung Maritim 4.0" - Tagungsband zur Konferenz Go-3D 2019}}, editor = {{Lukas, Uwe and Bauer, Kristine and Dolereit, Tim}}, pages = {{45--57}}, publisher = {{Fraunhofer Verlag}}, title = {{{Unterstützung des Lernens für kritische Situationen: Potenzial von Augmented Reality für die Instandsetzung auf See}}}, year = {{2019}}, } @inproceedings{48841, abstract = {{We tackle a bi-objective dynamic orienteering problem where customer requests arise as time passes by. The goal is to minimize the tour length traveled by a single delivery vehicle while simultaneously keeping the number of dismissed dynamic customers to a minimum. We propose a dynamic Evolutionary Multi-Objective Algorithm which is grounded on insights gained from a previous series of work on an a-posteriori version of the problem, where all request times are known in advance. In our experiments, we simulate different decision maker strategies and evaluate the development of the Pareto-front approximations on exemplary problem instances. It turns out, that despite severely reduced computational budget and no oracle-knowledge of request times the dynamic EMOA is capable of producing approximations which partially dominate the results of the a-posteriori EMOA and dynamic integer linear programming strategies.}}, author = {{Bossek, Jakob and Grimme, Christian and Meisel, Stephan and Rudolph, Günter and Trautmann, Heike}}, booktitle = {{Evolutionary Multi-Criterion Optimization (EMO)}}, editor = {{Deb, Kalyanmoy and Goodman, Erik and Coello Coello, Carlos A. and Klamroth, Kathrin and Miettinen, Kaisa and Mostaghim, Sanaz and Reed, Patrick}}, isbn = {{978-3-030-12598-1}}, keywords = {{Combinatorial optimization, Dynamic optimization, Metaheuristics, Multi-objective optimization, Vehicle routing}}, pages = {{516–528}}, publisher = {{Springer International Publishing}}, title = {{{Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm}}}, doi = {{10.1007/978-3-030-12598-1_41}}, year = {{2019}}, } @inproceedings{48842, abstract = {{Evolutionary algorithms have successfully been applied to evolve problem instances that exhibit a significant difference in performance for a given algorithm or a pair of algorithms inter alia for the Traveling Salesperson Problem (TSP). Creating a large variety of instances is crucial for successful applications in the blooming field of algorithm selection. In this paper, we introduce new and creative mutation operators for evolving instances of the TSP. We show that adopting those operators in an evolutionary algorithm allows for the generation of benchmark sets with highly desirable properties: (1) novelty by clear visual distinction to established benchmark sets in the field, (2) visual and quantitative diversity in the space of TSP problem characteristics, and (3) significant performance differences with respect to the restart versions of heuristic state-of-the-art TSP solvers EAX and LKH. The important aspect of diversity is addressed and achieved solely by the proposed mutation operators and not enforced by explicit diversity preservation.}}, author = {{Bossek, Jakob and Kerschke, Pascal and Neumann, Aneta and Wagner, Markus and Neumann, Frank and Trautmann, Heike}}, booktitle = {{Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}}, isbn = {{978-1-4503-6254-2}}, keywords = {{benchmarking, instance features, optimization, problem generation, traveling salesperson problem}}, pages = {{58–71}}, publisher = {{Association for Computing Machinery}}, title = {{{Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators}}}, doi = {{10.1145/3299904.3340307}}, year = {{2019}}, } @inproceedings{48843, abstract = {{We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical graph coloring problem and investigate the dynamic setting where edges are added to the current graph. We then analyze the expected time for randomized search heuristics to recompute high quality solutions. This includes the (1+1) EA and RLS in a setting where the number of colors is bounded and we are minimizing the number of conflicts as well as iterated local search algorithms that use an unbounded color palette and aim to use the smallest colors and - as a consequence - the smallest number of colors. We identify classes of bipartite graphs where reoptimization is as hard as or even harder than optimization from scratch, i. e. starting with a random initialization. Even adding a single edge can lead to hard symmetry problems. However, graph classes that are hard for one algorithm turn out to be easy for others. In most cases our bounds show that reoptimization is faster than optimizing from scratch. Furthermore, we show how to speed up computations by using problem specific operators concentrating on parts of the graph where changes have occurred.}}, author = {{Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-6111-8}}, keywords = {{dynamic optimization, evolutionary algorithms, running time analysis, theory}}, pages = {{1443–1451}}, publisher = {{Association for Computing Machinery}}, title = {{{Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring}}}, doi = {{10.1145/3321707.3321792}}, year = {{2019}}, } @inproceedings{48840, abstract = {{Research has shown that for many single-objective graph problems where optimum solutions are composed of low weight sub-graphs, such as the minimum spanning tree problem (MST), mutation operators favoring low weight edges show superior performance. Intuitively, similar observations should hold for multi-criteria variants of such problems. In this work, we focus on the multi-criteria MST problem. A thorough experimental study is conducted where we estimate the probability of edges being part of non-dominated spanning trees as a function of the edges’ non-domination level or domination count, respectively. Building on gained insights, we propose several biased one-edge-exchange mutation operators that differ in the used edge-selection probability distribution (biased towards edges of low rank). Our empirical analysis shows that among different graph types (dense and sparse) and edge weight types (both uniformly random and combinations of Euclidean and uniformly random) biased edge-selection strategies perform superior in contrast to the baseline uniform edge-selection. Our findings are in particular strong for dense graphs.}}, author = {{Bossek, Jakob and Grimme, Christian and Neumann, Frank}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-6111-8}}, keywords = {{biased mutation, combinatorial optimization, minimum spanning tree, multi-objective optimization}}, pages = {{516–523}}, publisher = {{Association for Computing Machinery}}, title = {{{On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem}}}, doi = {{10.1145/3321707.3321818}}, year = {{2019}}, } @inproceedings{48858, abstract = {{The $$\textbackslash mathcal NP$$-hard multi-criteria shortest path problem (mcSPP) is of utmost practical relevance, e.~g., in navigation system design and logistics. We address the problem of approximating the Pareto-front of the mcSPP with sum objectives. We do so by proposing a new mutation operator for multi-objective evolutionary algorithms that solves single-objective versions of the shortest path problem on subgraphs. A rigorous empirical benchmark on a diverse set of problem instances shows the effectiveness of the approach in comparison to a well-known mutation operator in terms of convergence speed and approximation quality. In addition, we glance at the neighbourhood structure and similarity of obtained Pareto-optimal solutions and derive promising directions for future work.}}, author = {{Bossek, Jakob and Grimme, Christian}}, booktitle = {{Learning and Intelligent Optimization}}, editor = {{Battiti, Roberto and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}}, isbn = {{978-3-030-05348-2}}, pages = {{184–198}}, publisher = {{Springer International Publishing}}, title = {{{Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems}}}, doi = {{10.1007/978-3-030-05348-2_17}}, year = {{2019}}, } @inproceedings{48875, abstract = {{A multiobjective perspective onto common performance measures such as the PAR10 score or the expected runtime of single-objective stochastic solvers is presented by directly investigating the tradeoff between the fraction of failed runs and the average runtime. Multi-objective indicators operating in the bi-objective space allow for an overall performance comparison on a set of instances paving the way for instance-based automated algorithm selection techniques.}}, author = {{Bossek, Jakob and Trautmann, Heike}}, booktitle = {{Learning and Intelligent Optimization}}, editor = {{Battiti, Roberto and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}}, isbn = {{978-3-030-05348-2}}, keywords = {{Algorithm selection, Performance measurement}}, pages = {{215–219}}, publisher = {{Springer International Publishing}}, title = {{{Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time}}}, doi = {{10.1007/978-3-030-05348-2_19}}, year = {{2019}}, } @inproceedings{22041, abstract = {{The Arburg Plastic Freeforming (APF) is an additive manufacturing process that allows three-dimensional, thermoplastic components to be produced in layer by layer. The components are generated by depositing fine, molten plastic droplets. One of the main advantages of the APF process is the open machine control. Thus, the process parameters can be adapted and optimized for the individual applications. The optimization is carried out on the basis of a variation of the process parameters using a statistical design of experiments. Relevant process parameters are the layer thickness, the form factor, the raster and delta angle as well as the overlap between the contour and the filling of a layer. In addition, the nozzle and build chamber temperatures are varied. Using this procedure, the effects of the influencing parameters on the mechanical properties and the interactions between the influencing parameters are analyzed and converted into mathematical models. On the basis of the results and the models, guidelines will be developed to assist the user of APF technology in the systematic process configuration for their own applications. The material used is ABS, one of the most frequently used amorphous thermoplastics in additive manufacturing. The mechanical properties are determined on the basis of tensile tests and the characteristic values tensile strength, elongation at break and Young's modulus. The results should show the performance of the APF technology in regard to the mechanical properties.}}, author = {{Moritzer, Elmar and Hirsch, André and Hecker, Felix}}, booktitle = {{30th Annual International Solid Freeform Fabrication Symposium}}, pages = {{705--714}}, title = {{{Process Parameter Optimization to Improve the Mechanical Properties of Arburg Plastic Freeformed Components}}}, doi = {{http://dx.doi.org/10.26153/tsw/17308}}, volume = {{30}}, year = {{2019}}, } @article{53274, abstract = {{This paper studies the performance of improper Gaussian signaling (IGS) over a 2-user Rayleigh single-input single-output (SISO) interference channel, treating interference as noise. We assume that the receivers have perfect channel state information (CSI), while the transmitters have access to only statistical CSI. Under these assumptions, we consider a signaling scheme, which we refer to as proper/improper Gaussian signaling or PGS/IGS, where at most one user may employ IGS. For the Rayleigh fading channel model, we characterize the statistical distribution of the signal-to-interference-plus-noise ratio at each receiver and derive closed-form expressions for the ergodic rates. By adapting the powers, we characterize the Pareto boundary of the ergodic rate region for the 2-user fading IC. The ergodic transmission rates can be attained using fixed-rate codebooks and no optimization is involved. Our results show that, in the moderate and strong interference regimes, the proposed PGS/IGS scheme improves the performance with respect to the PGS scheme. Additionally, we numerically compute the ergodic rate region of the full IGS scheme when both users can employ IGS and their transmission parameters are optimized by an exhaustive search. Our results suggest that most of the Pareto optimal points for the 2-user fading IC channel are attained when either both users transmit PGS or when one transmits PGS and the other transmits maximally improper Gaussian signals and time sharing is allowed.}}, author = {{Soleymani, Mohammad and Santamaria, Ignacio and Lameiro, Christian and Schreier, Peter J.}}, issn = {{1099-4300}}, journal = {{Entropy}}, keywords = {{General Physics and Astronomy}}, number = {{10}}, publisher = {{MDPI AG}}, title = {{{Ergodic Rate for Fading Interference Channels with Proper and Improper Gaussian Signaling}}}, doi = {{10.3390/e21100922}}, volume = {{21}}, year = {{2019}}, } @article{4684, abstract = {{Recent years have seen the emergence of physical products that are digitally networked with other products and with information systems to enable complex business scenarios in manufacturing, mobility, or healthcare. These “smart products”, which enable the co-creation of “smart service” that is based on monitoring, optimization, remote control, and autonomous adaptation of products, profoundly transform service systems into what we call “smart service systems”. In a multi-method study that includes conceptual research and qualitative data from in-depth interviews, we conceptualize “smart service” and “smart service systems” based on using smart products as boundary objects that integrate service consumers’ and service providers’ resources and activities. Smart products allow both actors to retrieve and to analyze aggregated field evidence and to adapt service systems based on contextual data. We discuss the implications that the introduction of smart service systems have for foundational concepts of service science and conclude that smart service systems are characterized by technology-mediated, continuous, and routinized interactions.}}, author = {{Beverungen, Daniel and Müller, Oliver and Matzner, Martin and Mendling, Jan and vom Brocke, Jan}}, issn = {{14228890}}, journal = {{Electronic Markets}}, keywords = {{Boundary object, Internet of things, Service science, Smart products, Smart service}}, pages = {{7--18}}, publisher = {{SpringerNature}}, title = {{{Conceptualizing smart service systems}}}, doi = {{10.1007/s12525-017-0270-5}}, volume = {{29}}, year = {{2019}}, } @article{53976, author = {{Mousavi, Seyed Mohsen and Tavana, Madjid and Alikar, Najmeh and Zandieh, Mostafa}}, issn = {{0941-0643}}, journal = {{Neural Computing and Applications}}, number = {{3}}, pages = {{873--885}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{A tuned hybrid intelligent fruit fly optimization algorithm for fuzzy rule generation and classification}}}, doi = {{10.1007/s00521-017-3115-4}}, volume = {{31}}, year = {{2019}}, }