@inproceedings{48874,
  abstract     = {{State of the Art inexact solvers of the NP-hard Traveling Salesperson Problem TSP are known to mostly yield high-quality solutions in reasonable computation times. With the purpose of understanding different levels of instance difficulties, instances for the current State of the Art heuristic TSP solvers LKH+restart and EAX+restart are presented which are evolved using a sophisticated evolutionary algorithm. More specifically, the performance differences of the respective solvers are maximized resulting in instances which are easier to solve for one solver and much more difficult for the other. Focusing on both optimization directions, instance features are identified which characterize both types of instances and increase the understanding of solver performance differences.}},
  author       = {{Bossek, Jakob and Trautmann, Heike}},
  booktitle    = {{Proceedings of the XV International Conference of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037}},
  isbn         = {{978-3-319-49129-5}},
  keywords     = {{Combinatorial optimization, Instance hardness, Metaheuristics, Transportation, TSP}},
  pages        = {{3–12}},
  publisher    = {{Springer-Verlag}},
  title        = {{{Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference}}},
  doi          = {{10.1007/978-3-319-49130-1_1}},
  year         = {{2016}},
}

@phdthesis{29027,
  abstract     = {{Over the last years, the Linked Open Data (LOD) has evolved from a mere 12 to more than 10, 000 knowledge bases. These knowledge bases come from diverse domains including (but not limited to) publications, life sciences, social networking, government, media, linguistics. Moreover, the LOD cloud also contains a large number of crossdomain knowledge bases such as DBpedia and Yago2. These knowledge bases are commonly managed in a decentralized fashion and contain partly overlapping information. This architectural choice has led to knowledge pertaining to the same domain being published by independent entities in the LOD cloud. For example, information on drugs can be found in Diseasome as well as DBpedia and Drugbank. Furthermore, certain knowledge bases such as DBLP have been published by several bodies, which in turn has lead to duplicated content in the LOD. In addition, large amounts of geo-spatial information have been made available with the growth of heterogeneous Web of Data. The concurrent publication of knowledge bases containing related information promises to become a phenomenon of increasing importance with the growth of the number of independent data providers. Enabling the joint use of the knowledge bases published by these providers for tasks such as federated queries, cross-ontology question answering and data integration is most commonly tackled by creating links between the resources described within these knowledge bases. Within this thesis, we spur the transition from isolated knowledge bases to enriched Linked Data sets where information can be easily integrated and processed. To achieve this goal, we provide concepts, approaches and use cases that facilitate the integration and enrichment of information with other data types that are already present on the Linked Data Web with a focus on geo-spatial data. The first challenge that motivates our work is the lack of measures that use the geographic data for linking geo-spatial knowledge bases. This is partly due to the geo-spatial resources being described by the means of vector geometry. In particular, discrepancies in granularity and error measurements across knowledge bases render the selection of appropriate distance measures for geo-spatial resources difficult. We address this challenge by evaluating existing literature for pointset measures that can be used to measure the similarity of vector geometries. Then, we present and evaluate the ten measures that we derived from the literature on samples of three real knowledge bases. The second challenge we address in this thesis is the lack of automatic Link Discovery (LD) approaches capable of dealing with geospatial knowledge bases with missing and erroneous data. To this end,we present Colibri, an unsupervised approach that allows discovering links between knowledge bases while improving the quality of the instance data in these knowledge bases. A Colibri iteration begins by generating links between knowledge bases. Then, the approach makes use of these links to detect resources with probably erroneous or missing information. This erroneous or missing infor- mation detected by the approach is finally corrected or added. The third challenge we address is the lack of scalable LD approaches for tackling big geo-spatial knowledge bases. Thus, we present Deterministic Particle-Swarm Optimization (DPSO), a novel load balancing technique for LD on parallel hardware based on particle-swarm optimization. We combine this approach with the Orchid algorithm for geo-spatial linking and evaluate it on real and artificial data sets. The lack of approaches for automatic updating of links of an evolving knowledge base is our fourth challenge. This challenge is addressed in this thesis by the Wombat algorithm. Wombat is a novel approach for the discovery of links between knowledge bases that relies exclusively on positive examples. Wombat is based on generalisation via an upward refinement operator to traverse the space of Link Specifications (LS). We study the theoretical characteristics of Wombat and evaluate it on different benchmark data sets. The last challenge addressed herein is the lack of automatic approaches for geo-spatial knowledge base enrichment. Thus, we propose Deer, a supervised learning approach based on a refinement operator for enriching Resource Description Framework (RDF) data sets. We show how we can use exemplary descriptions of enriched resources to generate accurate enrichment pipelines. We evaluate our approach against manually defined enrichment pipelines and show that our approach can learn accurate pipelines even when provided with a small number of training examples. Each of the proposed approaches is implemented and evaluated against state-of-the-art approaches on real and/or artificial data sets. Moreover, all approaches are peer-reviewed and published in a con- ference or a journal paper. Throughout this thesis, we detail the ideas, implementation and the evaluation of each of the approaches. Moreover, we discuss each approach and present lessons learned. Finally, we conclude this thesis by presenting a set of possible future extensions and use cases for each of the proposed approaches.}},
  author       = {{Sherif, Mohamed}},
  keywords     = {{2016 group\_aksw sys:relevantFor:geoknow sys:relevantFor:infai sys:relevantFor:bis ngonga simba dice sherif group\_aksw geoknow deer lehmann MOLE}},
  publisher    = {{University of Leipzig}},
  title        = {{{Automating Geospatial RDF Dataset Integration and Enrichment}}},
  year         = {{2016}},
}

@article{54172,
  author       = {{Mousavi, Seyed Mohsen and Sadeghi, Javad and Niaki, Seyed Taghi Akhavan and Tavana, Madjid}},
  issn         = {{1568-4946}},
  journal      = {{Applied Soft Computing}},
  pages        = {{57--72}},
  publisher    = {{Elsevier BV}},
  title        = {{{A bi-objective inventory optimization model under inflation and discount using tuned Pareto-based algorithms: NSGA-II, NRGA, and MOPSO}}},
  doi          = {{10.1016/j.asoc.2016.02.014}},
  volume       = {{43}},
  year         = {{2016}},
}

@article{54166,
  author       = {{Khanjani Shiraz, Rashed and Tavana, Madjid and Di Caprio, Debora and Fukuyama, Hirofumi}},
  issn         = {{0022-3239}},
  journal      = {{Journal of Optimization Theory and Applications}},
  number       = {{1}},
  pages        = {{243--265}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Solving Geometric Programming Problems with Normal, Linear and Zigzag Uncertainty Distributions}}},
  doi          = {{10.1007/s10957-015-0857-y}},
  volume       = {{170}},
  year         = {{2016}},
}

@article{54167,
  author       = {{Hajipour, Vahid and Fattahi, Parviz and Tavana, Madjid and Di Caprio, Debora}},
  issn         = {{0307-904X}},
  journal      = {{Applied Mathematical Modelling}},
  number       = {{7-8}},
  pages        = {{4948--4969}},
  publisher    = {{Elsevier BV}},
  title        = {{{Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics}}},
  doi          = {{10.1016/j.apm.2015.12.013}},
  volume       = {{40}},
  year         = {{2016}},
}

@article{54155,
  author       = {{Tavana, Madjid and Li, Zhaojun and Mobin, Mohammadsadegh and Komaki, Mohammad and Teymourian, Ehsan}},
  issn         = {{0957-4174}},
  journal      = {{Expert Systems with Applications}},
  pages        = {{17--39}},
  publisher    = {{Elsevier BV}},
  title        = {{{Multi-objective control chart design optimization using NSGA-III and MOPSO enhanced with DEA and TOPSIS}}},
  doi          = {{10.1016/j.eswa.2015.11.007}},
  volume       = {{50}},
  year         = {{2016}},
}

@inproceedings{46365,
  abstract     = {{Despite the intrinsic hardness of the Traveling Salesperson Problem (TSP) heuristic solvers, e.g., LKH+restart and EAX+restart, are remarkably successful in generating satisfactory or even optimal solutions. However, the reasons for their success are not yet fully understood. Recent approaches take an analytical viewpoint and try to identify instance features, which make an instance hard or easy to solve. We contribute to this area by generating instance sets for couples of TSP algorithms A and B by maximizing/minimizing their performance difference in order to generate instances which are easier to solve for one solver and much harder to solve for the other. This instance set offers the potential to identify key features which allow to distinguish between the problem hardness classes of both algorithms.}},
  author       = {{Bossek, Jakob and Trautmann, Heike}},
  booktitle    = {{Learning and Intelligent Optimization}},
  editor       = {{Festa, P and Sellmann, M and Vanschoren, J}},
  isbn         = {{978-3-319-50348-6}},
  pages        = {{48–59}},
  publisher    = {{Springer International Publishing}},
  title        = {{{Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers}}},
  doi          = {{10.1007/978-3-319-50349-3_4}},
  volume       = {{10079}},
  year         = {{2016}},
}

@inproceedings{46366,
  abstract     = {{State of the Art inexact solvers of the NP-hard Traveling Salesperson Problem (TSP) are known to mostly yield high-quality solutions in reasonable computation times. With the purpose of understanding different levels of instance difficulties, instances for the current State of the Art heuristic TSP solvers LKH+restart and EAX+restart are presented which are evolved using a sophisticated evolutionary algorithm. More specifically, the performance differences of the respective solvers are maximized resulting in instances which are easier to solve for one solver and much more difficult for the other. Focusing on both optimization directions, instance features are identified which characterize both types of instances and increase the understanding of solver performance differences.}},
  author       = {{Bossek, Jakob and Trautmann, Heike}},
  booktitle    = {{AI*IA 2016 Advances in Artificial Intelligence}},
  editor       = {{Adorni, G and Cagnoni, S and Gori, M and Maratea, M}},
  isbn         = {{978-3-319-49129-5}},
  pages        = {{3–12}},
  publisher    = {{Springer}},
  title        = {{{Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference}}},
  doi          = {{10.1007/978-3-319-49130-1_1}},
  volume       = {{10037}},
  year         = {{2016}},
}

@article{54929,
  abstract     = {{The epithelial sodium channel (ENaC) is rate limiting for Na(+) absorption in the aldosterone-sensitive distal nephron comprising the late distal convoluted tubule (DCT2), the connecting tubule (CNT), and the entire collecting duct. Liddle syndrome (pseudohyperaldosteronism), a severe form of salt-sensitive hypertension, is caused by gain-of-function mutations of ENaC, but the precise tubular site of increased ENaC function is unknown. In the cortical collecting duct (CCD), ENaC is known to be regulated by aldosterone. In contrast, we recently reported aldosterone-independent ENaC regulation in the early part of the aldosterone-sensitive distal nephron. Here, we investigated ENaC function in the transition zone of DCT2/CNT or CNT/CCD microdissected from mice homozygous for Liddle syndrome mutation or from wild-type control mice. Whole-cell patch-clamp recordings were used to measure amiloride-sensitive ENaC currents in nephron fragments from mice maintained on different sodium diets to vary plasma aldosterone levels. Our data indicate that in mice with Liddle syndrome, the primary site of increased Na(+) reabsorption is the DCT2/CNT. In addition, increased aldosterone responsiveness of ENaC in CNT/CCD may contribute to salt-sensitive hypertension in Liddle syndrome. Single channel properties of ENaC were similar in Liddle syndrome mutation and wild-type mice, but ENaC expression at the apical membrane was increased in Liddle syndrome mutation when compared with wild-type mice, in particular, in animals maintained on a high salt diet. Our findings highlight the importance of ENaC function and regulation in the early part of the aldosterone-sensitive distal nephron for the maintenance of sodium balance and blood pressure control.}},
  author       = {{Nesterov, Viatcheslav and Krueger, Bettina and Bertog, Marko and Dahlmann, Anke and Palmisano, Ralf and Korbmacher, Christoph}},
  journal      = {{Hypertension}},
  number       = {{6}},
  pages        = {{1256–1262}},
  publisher    = {{Ovid Technologies (Wolters Kluwer Health)}},
  title        = {{{In Liddle Syndrome, Epithelial Sodium Channel Is Hyperactive Mainly in the Early Part of the Aldosterone-Sensitive Distal Nephron}}},
  doi          = {{10.1161/hypertensionaha.115.07061}},
  volume       = {{67}},
  year         = {{2016}},
}

@article{35710,
  author       = {{Tussing, Sebastian and Kaupmees, Karl and Paradies, Jan}},
  issn         = {{0947-6539}},
  journal      = {{Chemistry – A European Journal}},
  keywords     = {{General Chemistry, Catalysis, Organic Chemistry}},
  number       = {{22}},
  pages        = {{7302--7302}},
  publisher    = {{Wiley}},
  title        = {{{Inside Cover: Structure–Reactivity Relationship in the Frustrated Lewis Pair (FLP)‐Catalyzed Hydrogenation of Imines (Chem. Eur. J. 22/2016)}}},
  doi          = {{10.1002/chem.201601558}},
  volume       = {{22}},
  year         = {{2016}},
}

@article{22257,
  author       = {{Tussing, Sebastian and Kaupmees, Karl and Paradies, Jan}},
  issn         = {{0947-6539}},
  journal      = {{Chemistry - A European Journal}},
  pages        = {{7302--7302}},
  title        = {{{Inside Cover: Structure-Reactivity Relationship in the Frustrated Lewis Pair (FLP)-Catalyzed Hydrogenation of Imines (Chem. Eur. J. 22/2016)}}},
  doi          = {{10.1002/chem.201601558}},
  year         = {{2016}},
}

@article{42173,
  author       = {{Nagahara, M. and stergaard, J. and Quevedo, D. E.}},
  journal      = {{EURASIP J. Adv. Signal Processing}},
  number       = {{1}},
  pages        = {{1–8}},
  title        = {{{Discrete-time hands-off control by sparse optimization}}},
  volume       = {{76}},
  year         = {{2016}},
}

@inproceedings{39478,
  author       = {{Hangmann, C and Mager, T and Khan, S and Hedayat, C and Hilleringmann, Ulrich}},
  booktitle    = {{Smart System Integration-International Conference and Exhibition on Integration Issues of Miniaturized Systems}},
  title        = {{{Improved rf design using precise 3d near-field measurements and near-field to far-field transformations}}},
  year         = {{2016}},
}

@article{13916,
  abstract     = {{Nonlinearity is the driving force for numerous important effects in nature typically showing transitions between different regimes, regular, chaotic or catastrophic behavior. Localized nonlinear modes have been the focus of intense research in areas such as fluid and gas dynamics, photonics, atomic and solid state physics etc. Due to the richness of the behavior of nonlinear systems and due to the severe numerical demands of accurate three-dimensional (3D) numerical simulations presently only little knowledge is available on the dynamics of complex nonlinear modes in 3D. Here, we investigate the dynamics of 3D non-coaxial matter wave vortices that are trapped in a parabolic potential and interact via a repulsive nonlinearity. Our numerical simulations demonstrate the existence of an unexpected and fascinating nonlinear regime that starts immediately when the nonlinearity is switched-on and is characterized by a smooth dynamics representing torque-free precession with nutations. The reported motion is proven to be robust regarding various effects such as the number of particles, dissipation and trap deformations and thus should be observable in suitably designed experiments. Since our theoretical approach, i.e., coupled nonlinear Schrödinger equations, is quite generic, we expect that the obtained novel dynamical behavior should also exist in other nonlinear systems.}},
  author       = {{Driben, R. and Konotop, V. V. and Meier, Torsten}},
  issn         = {{2045-2322}},
  journal      = {{Scientific Reports}},
  title        = {{{Precession and nutation dynamics of nonlinearly coupled non-coaxial three-dimensional matter wave vortices}}},
  doi          = {{10.1038/srep22758}},
  volume       = {{6}},
  year         = {{2016}},
}

@article{64421,
  author       = {{Göring, Lena and Finkeldey, Markus and Gerhardt, Nils Christopher and Hofmann, Martin R.}},
  journal      = {{Adaptive Optics: Analysis, Methods & Systems}},
  title        = {{{Common-path digital holography microscopy of buried semiconductor specimen}}},
  doi          = {{10.1364/3d.2016.jw4a.40}},
  year         = {{2016}},
}

@article{43194,
  abstract     = {{For incident light polarized perpendicular to the tube axis the multi-band semiconductor Bloch equations (MB-SBEs) that involve various screened interband Coulomb interactions (ICIs) are derived. The calculated E 12 peak is very close to the longitudinal excitonic peak E 22. Compared with the previous theoretical peak positions, the blue-shift of the peak in our results is about 0.5 eV. Then, subsequent detailed analyses show that the screening effect on the diagonal ICIs (D-ICIs) plays a key role in this big blue-shift. The valley-degenerate transverse pair excitations holding the same selection rule further enhance the screening effect on D-ICIs. Specially at q = 0 the dielectric function acting on the D-ICIs enhances two times. In our calculation the strong screening effect contributes 90% of the big blue-shift, while the non-diagonal ICIs (ND-ICIs) contribute to 10% of the blue-shift.}},
  author       = {{Meier, Torsten and Liu, Hong}},
  journal      = {{The European Physical Journal B}},
  title        = {{{Influence of strong screening effect on the perpendicular polarized linear excitonic absorption spectra of semiconducting carbon nanotubes}}},
  doi          = {{10.1140/epjb/e2016-70476-8}},
  volume       = {{89}},
  year         = {{2016}},
}

@article{60437,
  abstract     = {{<jats:p>Parametrization based methods have recently become very popular for the generation of high quality quad meshes. In contrast to previous approaches, they allow for intuitive user control in order to accommodate all kinds of application driven constraints and design intentions. A major obstacle in practice, however, are the relatively long computations that lead to response times of several minutes already for input models of moderate complexity. In this paper we introduce a novel strategy to handle highly complex input meshes with up to several millions of triangles such that quad meshes can still be created and edited within an interactive workflow. Our method is based on representing the input model on different levels of resolution with a mechanism to propagate parametrizations from coarser to finer levels. The major challenge is to guarantee consistent parametrizations even in the presence of charts, transition functions, and singularities. Moreover, the remaining degrees of freedom on coarser levels of resolution have to be chosen carefully in order to still achieve low distortion parametrizations. We demonstrate a prototypic system where the user can interactively edit quad meshes with powerful high-level operations such as guiding constraints, singularity repositioning, and singularity connections.</jats:p>}},
  author       = {{Ebke, Hans-Christian and Schmidt, Patrick and Campen, Marcel and Kobbelt, Leif}},
  issn         = {{0730-0301}},
  journal      = {{ACM Transactions on Graphics}},
  number       = {{6}},
  pages        = {{1--13}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Interactively controlled quad remeshing of high resolution 3D models}}},
  doi          = {{10.1145/2980179.2982413}},
  volume       = {{35}},
  year         = {{2016}},
}

@article{60434,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Direction fields and vector fields play an increasingly important role in computer graphics and geometry processing. The synthesis of directional fields on surfaces, or other spatial domains, is a fundamental step in numerous applications, such as mesh generation, deformation, texture mapping, and many more. The wide range of applications resulted in definitions for many types of directional fields: from vector and tensor fields, over line and cross fields, to frame and vector‐set fields. Depending on the application at hand, researchers have used various notions of objectives and constraints to synthesize such fields. These notions are defined in terms of fairness, feature alignment, symmetry, or field topology, to mention just a few. To facilitate these objectives, various representations, discretizations, and optimization strategies have been developed. These choices come with varying strengths and weaknesses. This report provides a systematic overview of directional field synthesis for graphics applications, the challenges it poses, and the methods developed in recent years to address these challenges.</jats:p>}},
  author       = {{Vaxman, Amir and Campen, Marcel and Diamanti, Olga and Panozzo, Daniele and Bommes, David and Hildebrandt, Klaus and Ben‐Chen, Mirela}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{2}},
  pages        = {{545--572}},
  publisher    = {{Wiley}},
  title        = {{{Directional Field Synthesis, Design, and Processing}}},
  doi          = {{10.1111/cgf.12864}},
  volume       = {{35}},
  year         = {{2016}},
}

@article{60436,
  abstract     = {{<jats:p>This paper presents a method for bijective parametrization of 2D and 3D objects over canonical domains. While a range of solutions for the two-dimensional case are well-known, our method guarantees bijectivity of mappings also for a large, combinatorially-defined class of tetrahedral meshes (shellable meshes). The key concept in our method is the piecewise-linear (PL) foliation, decomposing the mesh into one-dimensional submanifolds and reducing the mapping problem to parametrization of a lower-dimensional manifold (a foliation section). The maps resulting from these foliations are proved to be bijective and continuous, and shown to have provably bijective PL approximations. We describe exact, numerically robust evaluation methods and demonstrate our implementation's capabilities on a large variety of meshes.</jats:p>}},
  author       = {{Campen, Marcel and Silva, Cláudio T. and Zorin, Denis}},
  issn         = {{0730-0301}},
  journal      = {{ACM Transactions on Graphics}},
  number       = {{4}},
  pages        = {{1--15}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Bijective maps from simplicial foliations}}},
  doi          = {{10.1145/2897824.2925890}},
  volume       = {{35}},
  year         = {{2016}},
}

@inproceedings{25323,
  author       = {{Weber, Jens}},
  booktitle    = {{Proceedings of the 2015 Winter Simulation Conference}},
  editor       = {{Yilmaz,  L and Chan, K. V and Moon, I and  Roeder, T. M. K,  T. M. K and Macal, C and Rossetti,  M. D}},
  title        = {{{A Technical Approach of a Simulation-Based Optimization Platform for Setup-Preparation via Virtual Tooling by Testing the Optimization of Zero Point Positions in CNC-Applications}}},
  year         = {{2015}},
}