TY - CHAP A1 - Stadler, Timo A1 - Hofmeister, Simon A1 - Dünnweber, Jan T1 - A Method for the Optimized Placement of Bus Stops Based on Voronoi Diagrams T2 - Proceedings of the 55th Hawaii International Conference on System Sciences (HICSS55): January 3-7, 2022, Maui, Hawaii, USA N2 - In this paper a new method for placing bus stops is presented. The method is suitable for permanently installed new bus stops and temporarily chosen collection points for call busses as well. Moreover, our implementation of the Voronoi algorithm chooses new locations for bus stops in such a way that more bus stops are set in densely populated areas and less in less populated areas. To achieve this goal, a corresponding weighting is applied to each possible placement point, based on the number of inhabitants around this point and the points of interest, such as medical centers and department stores around this point. Using the area of Roding, a small town in Bavaria, for a case study, we show that our method is especially suitable for for rural areas, where there are few multi-family houses or apartment blocks and the area is not densely populated. KW - rural mobility KW - transportation KW - voronoi KW - bus stop placement KW - Location Intelligence Research in System Sciences Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-21214 SP - 5686 EP - 5694 ER - TY - CHAP A1 - Dünnweber, Jan A1 - Lüdeking, Philipp A1 - Gorlatch, Sergei ED - Danelutto, Marco ED - Fragopoulou, Paraskevi ED - Getov, Vladimir T1 - A Higher-Order Component for Efficient Genome Processing on the Grid T2 - Making Grids Work N2 - Computational grids combine computers in the Internet for distributed data processing and are an attractive platform for the data-intensive applications of bioinformatics. We present an extensible genome processing software for the grid and evaluate its performance. Our software was able to discover previously unknown circular permutations (CP) in the ProDom database containing more than 70MB of protein data. A specific feature of our software is its design as a component: the Alignment HOC, a Higher-Order Component that makes use of the latest Globus toolkit as grid middleware. Besides genome data, the Alignment HOC accepts plugin code for processing this data as its input, and contains all the required configuration to run the component on top of Globus, thus, freeing the non-grid-expert user from dealing with grid middleware. Instead of writing data distribution procedures and configuring the middleware appropriately for every new algorithm, Alignment HOC users reuse the existing component and only write application-specific plugins. To maintain plugins persistently in a reusable manner, we built a web-accessible plugin database with a comfortable administration GUI. The flexible component-based implementation makes it easy to study CPs in other databases (e.g. UniProt/Swiss-Prot) or to use an alignment algorithm different than the standard Needleman-Wunsch. For the efficient distribution of workload, we developed a library of group communication operations for HOCs. KW - higher-order components KW - genome processing KW - sequence alignment KW - middleware Y1 - 2007 SN - 978-0-387-78447-2 U6 - https://doi.org/10.1007/978-0-387-78448-9_28 SP - 351 EP - 362 PB - Springer CY - Boston, MA ER - TY - CHAP A1 - Dünnweber, Jan A1 - Tomasoni, Johannes A1 - Gorlatch, Sergei A1 - Claßen, Michael A1 - Claßen, Philipp A1 - Lengauer, Christian ED - Gorlatch, Sergei ED - Fragopoulou, Paraskevi ED - Priol, Thierry T1 - A Grid Component with Embedded Loop Parallelization T2 - Grid Computing N2 - This work integrates two distinct research areas of parallel and distributed computing, (1) automatic loop parallelization, and (2) component-based Grid programming. The latter includes technologies developed within CoreGRID for simplifying Grid programming: the Grid ComponentModel (GCM) and Higher- Order Components (HOCs). Components support developing applications on the Grid without taking all the technical details of the particular platform type into account (network communication, heterogeneity, etc.). The GCMenables a hierarchical composition of programpieces and HOCs enable the reuse of component code in the development of new applications by specifying application-specific operations in a program via code parameters. When a programmer is provided, e. g., with a compute farm HOC, only the independent worker tasks must be described. But, once an application exhibits data or control dependences, the trivial farm is no longer sufficient. Here, the power of loop parallelization tools, like LooPo, comes into play: by embedding LooPo into a HOC, we show that these two technologies in combination facilitate the automatic transformation of a sequential loop nest with complex dependences (supplied by the user as a HOC parameter) into an ordered task graph, which can be processed on the Grid in parallel. This technique can significantly simplify GCM-based systems which combine multiple HOCs and other components. We use an equation system solver based on the successive overrelaxation method (SOR) as our motivating application example and for performance experiments. KW - Higher-Order Components (HOCs) KW - Loop Parallelization KW - GCM KW - Grid Programming Y1 - 2007 SN - 978-0-387-09456-4 U6 - https://doi.org/10.1007/978-0-387-09457-1_22 SP - 261 EP - 273 PB - Springer CY - Berlin ER - TY - CHAP A1 - Dumitrescu, Câtâlin L. A1 - Epema, Dick H. J. A1 - Dünnweber, Jan ED - Gorlatch, Sergei ED - Bubak, Marian ED - Priol, Thierry T1 - User-Transparent Scheduling for Software Components on the Grid T2 - Achievements in European Research on Grid Systems N2 - Grid applications are increasingly being developed as workflows using well-structured, reusable components. We argue that components with well-defined semantics facilitate an efficient scheduling on the Grid. We have previously developed a user-transparent scheduling approach for Higher-Order Components (HOCs) – parallel implementations of typical programming patterns, accessible and customizable via Web services. Our approach combines three scheduling techniques: using cost functions for reducing communication overhead, reusability of schedules for similar workflows, and the aggregated submission of jobs. We analyze the user-transparent scheduling from four perspectives, namely: the easiness of integration within already existing Grid scheduling systems, the gains for individual users, the resource provider advantages, and the robustness with respect to execution failures. We perform our evaluation using the KOALA Grid scheduler extended to support our user-transparent scheduling, which we run on the DAS-2 system combining over 200 nodes at five sites in the Netherlands. The experimental results show an increase in throughput by more than 100%, a descreasing of the response time by 50%, and a failure reduction by 45% for the considered scenarios KW - User-Transparent Scheduling KW - Co-Allocation KW - Component Technology KW - Higher-Order Components Y1 - 2008 SN - 978-0-387-72811-7 U6 - https://doi.org/10.1007/978-0-387-72812-4_4 SP - 41 EP - 53 PB - Springer CY - Boston, MA ER - TY - JOUR A1 - Müller-Iden, Jens A1 - Dünnweber, Jan A1 - Gorlatch, Sergei A1 - Alt, Martin A1 - Fujita, Hamido A1 - Funyu, Yutaka T1 - Clayworks: Toward user-oriented software for collaborative modeling JF - Knowledge-Based Systems N2 - We consider the development of software systems that integrate collaborative real-time modeling and distributed computing. Our main goal is user-orientation: we need a collaborative workspace for geographically dispersed users with a seamless access of every user to high-performance servers. This paper presents a particular prototype, Clayworks, that allows modeling of virtual clay objects and running computation-intensive deformation simulations for objects crashing into each other. In order to integrate heterogeneous computational resources, we adopt modern Grid middleware and provide the users with an intuitive graphical interface. Simulations are parallelized using a higher-order component (HOC) which abstracts over the web service resource framework (WSRF) used to interconnect our worksuite to the computation server. Clayworks is a representative of a large class of demanding systems which combine collaborative, user-oriented modeling with performance-critical computations, e.g., crash-tests or simulations of biological population evolution. KW - User-oriented software development KW - Collaborative environments KW - Real-time modeling KW - High-performance simulation Y1 - 2008 U6 - https://doi.org/10.1016/j.knosys.2008.12.001 VL - 22 IS - 3 SP - 209 EP - 215 PB - Elsevier CY - Oxford, UK ER - TY - CHAP A1 - Dünnweber, Jan A1 - Aldinucci, Marco A1 - Gorlatch, Sergei A1 - Campa, Sonia A1 - Danelutto, Marco ED - Gorlatch, Sergei ED - Danelutto, Marco T1 - Adaptable Parallel Components for Grid Programming T2 - Integrated Research in GRID Computing N2 - We suggest that parallel software components used for grid computing should be adaptable to application-specific requirements, instead of developing new components from scratch for each particular application. As an example, we take a parallel farm component which is “embarrassingly parallel”, i. e., free of dependencies, and adapt it to the wavefront processing pattern with dependencies that impact its behavior. We describe our approach in the context of Higher-Order Components (HOCs), with the Java-based system Lithium as our implementation framework. The adaptation process relies on HOCs’ mobile code parameters that are shipped over the network of the grid. We describe our implementation of the proposed component adaptation method and report first experimental results for a particular grid application — the alignment of DNA sequence pairs, a popular, time-critical problem in computational molecular biology. KW - Grid Components KW - Adaptable Code KW - Wavefront Parallelism KW - Java KW - Web Services Y1 - 2006 SN - 978-0-387-47656-8 U6 - https://doi.org/10.1007/978-0-387-47658-2_4 SP - 43 EP - 57 PB - Springer Verlag CY - Boston, MA ER - TY - JOUR A1 - Dünnweber, Jan A1 - Kirsch, C. T1 - Report Datenmigration BT - Geeignete Umstiegstrategien in Großprojekten JF - iX - Magazin für professionelle Informationstechnik N2 - Mehrere Terabyte Daten aus einem auf dem Mainframe laufenden COBOL-Programm auf eine SOA-Architektur unter Linux zu migrieren, stellt besondere Anforderungen an die Werkzeuge und Entwickler. Geschickte Kombination vorhandener Tools und effizienter Strategien vermeiden Stillstandszeiten und beschleunigen den Datentransfer. Y1 - 2010 SN - 0935-9680 IS - 11 SP - 95 EP - 100 PB - Heise CY - Hannover ER - TY - CHAP A1 - Dünnweber, Jan A1 - Parlavatzas, Nikos A1 - Gorlatch, Sergei A1 - Baude, Francoise A1 - Legrand, Virginie ED - Gorlatch, Sergei ED - Danelutto, Marco T1 - Automatic Creation of Web Services for Grid Components T2 - Integrated Research in GRID Computing N2 - While high-level software components simplify the programming of grid applications and Web services increase their interoperability, developing such components and configuring the interconnecting services is a demanding task. In this paper, we consider the combination of Higher-Order Components (HOCs) with the Fractal component model and the ProActive library. HOCs are parallel programming components, made accessible on the grid via Web services that use a special class loader enabling code mobility: executable code can be uploaded to a HOC, allowing one to customize the HOC. Fractal simplifies the composition of components and the ProActive library offers a generator for automatically creating Web services from components composed with Fractal, as long as all the parameters of these services have primitive types. Taking all the advantages of HOCs, ProActive and Fractal together, the obvious conclusion is that composing HOCs using Fractal and automatically exposing them as Web services on the grid via ProActive minimizes the required efforts for building complex grid systems. In this context, we solved the problem of exchanging code-carrying parameters in automatically generated Web services by integrating the HOC class loading mechanism into the ProActive library. KW - CoreGRID Component Model (GCM) & Fractal KW - Higher-Order Components Y1 - 2006 SN - 978-0-387-47656-8 U6 - https://doi.org/10.1007/978-0-387-47658-2_3 SP - 31 EP - 42 PB - Springer CY - Sophia Antipolis, France ER - TY - CHAP A1 - Aldinucci, Marco A1 - Dünnweber, Jan A1 - Danelutto, Marco A1 - Golatch, Sergei ED - Grandinetti, Lucio T1 - Optimization techniques for skeletons on grids T2 - Grid Computing: The New Frontier of High Performance Computing N2 - Skeletons are common patterns of parallelism, such as farm and pipeline, that can be abstracted and offered to the application programmer as programming primitives. We describe the use and implementation of skeletons on emerging computational grids, with the skeleton system Lithium, based on Java and RMI, as our reference programming syttem. Our main contribution is the exploration of optimization techniques for implementing skeletons on grids based on an optimized, future-based RMI mechanism, which we integrate into the macro-dataflow evaluation mechanism of Lithium. We discuss three optimizations: 1) a lookahead mechanism that allows to process multiple tasks concurrently at each grid server and thereby increases the overall degree of parallelism, 2) a lazy taskbinding technique that reduces interactions between grid servers and the task dispatcher, and 3) dynamic improvements that optimize the collecting of results and the work-load balancing. We report experimental results that demonstrate the improvements due to our optimizations on various testbeds, including a heterogeneous grid-like environment. Y1 - 2005 SN - 978-0-08-046146-5 U6 - https://doi.org/10.1016/S0927-5452(05)80014-0 SP - 255 EP - 273 PB - Elsevier CY - Scotland ER - TY - CHAP A1 - Schrader, Jonas A1 - Stadler, Timo A1 - Dünnweber, Jan T1 - A Hybrid Genetic Algorithm for Solving the VRP with Pickup and Delivery in Rural Areas T2 - Proceedings of the 56th Hawaii International Conference on System Sciences: January 3-6, 2023, Maui Hawaii, USA N2 - In this paper, we present a new Hybrid Genetic Search (HGS) algorithm for solving the Capacitated Vehicle Routing Problem for Pickup and Delivery (CVRPPD) as it is required for public transport in rural areas. One of the biggest peculiarities here is that a large area has to be covered with as few vehicles as possible. The basic idea of this algorithm is based on a more general version of HGS, which we adopted to solve the CVRPPD in rural areas. It also implements improvements that lead to the acceleration of the algorithm and, thereby, to a faster generation of a fastest route. We tested the algorithm on real road data from Roding, a rural district in Bavaria, Germany. Moreover, we designed an API for converting data from the Openrouteservice, so that our algorithm can be applied on real world examples as well. Y1 - 2023 UR - https://scholarspace.manoa.hawaii.edu/items/3df366a9-3c24-4e7a-bb41-89edec5611f6 SN - 2572-6862 PB - University of Hawaiʻi at Mānoa CY - Honolulu, HI ER - TY - CHAP A1 - Gorlatch, Sergei A1 - Dünnweber, Jan ED - Getov, Vladimir ED - Laforenza, Domenico ED - Reinefeld, Alexander T1 - From Grid Middleware to Grid Applications BT - Bridging the Gap with HOCs T2 - Future Generation Grids N2 - This paper deals with the problem of application programming for grid systems that combine heterogeneous data and computational resources via the Internet. We argue that grid programming is still too complex because of the big gap between the currently used and anticipated grid middleware, (e.g., Globus or WSRF) and the application level. We suggest that this gap needs to be closed in future-generation grids and propose a novel approach to bridging the gap by using Higher-Order Components (HOCs) — recurring patterns of parallel behaviour that are provided to the user as program building blocks with pre-packaged implementation and middleware setup. The presentation is illustrated with a simple case study of computing fractal images. Our experiments demonstrate that HOCs can simplify grid application programming significantly, without serious performance loss. KW - components KW - Grid services KW - Globus toolkit KW - mobile code Y1 - 2005 SN - 978-0-387-27935-0 U6 - https://doi.org/10.1007/978-0-387-29445-2_13 SP - 241 EP - 261 PB - Springer Verlag CY - Berlin ER - TY - CHAP A1 - Dünnweber, Jan A1 - Gorlatch, Sergei T1 - HOC-SA BT - A Grid Service Architecture for Higher-Order Components T2 - IEEE International Conference on Services Computing (SCC 2004), 15-18 Sept. 2004, Shanghai, China N2 - The current efforts on programming grid applications often rely on service-oriented approaches like grid services. This work presents HOC-SA -a service architecture for higher-order components, which provides the programmer with reusable and composable patterns of parallelism and is interoperable with the latest Globus toolkit implementations. We describe our implementation of HOC-SA using OGSA-DAI, a framework for integrating grids with distributed databases. We present a simple example application and report first measurements on our grid testbed. KW - Web services KW - Programming profession KW - Parallel processing KW - Grid computing KW - Service oriented architecture KW - Testing KW - Distributed computing KW - Concurrent computing KW - Image segmentation KW - Electronic mail Y1 - 2004 SN - 0-7695-2225-4 U6 - https://doi.org/10.1109/SCC.2004.1358017 ER - TY - CHAP A1 - Winker, Tobias A1 - Groppe, Sven A1 - Uotila, Valter Johan Edvard A1 - Yan, Zhengtong A1 - Lu, Jiaheng A1 - Maja, Franz A1 - Mauerer, Wolfgang T1 - Quantum Machine Learning: Foundation, New Techniques, and Opportunities for Database Research T2 - SIGMOD '23, proceedings of the 2023 International Conference on Management of Data: June 18-23, 2023, Seattle, WA, USA N2 - In the last few years, the field of quantum computing has experienced remarkable progress. The prototypes of quantum computers already exist and have been made available to users through cloud services (e.g., IBM Q experience, Google quantum AI, or Xanadu quantum cloud). While fault-tolerant and large-scale quantum computers are not available yet (and may not be for a long time, if ever), the potential of this new technology is undeniable. Quantum algorithms havethe proven ability to either outperform classical approaches for several tasks, or are impossible to be efficiently simulated by classical means under reasonable complexity-theoretic assumptions. Even imperfect current-day technology is speculated to exhibit computational advantages over classical systems. Recent research is using quantum computers to solve machine learning tasks. Meanwhile, the database community already successfully applied various machine learning algorithms for data management tasks, so combining the fields seems to be a promising endeavour. However, quantum machine learning is a new research field for most database researchers. In this tutorial, we provide a fundamental introduction to quantum computing and quantum machine learning and show the potential benefits and applications for database research. In addition, we demonstrate how to apply quantum machine learning to the optimization of join order problem for databases. Y1 - 2023 U6 - https://doi.org/10.1145/3555041.3589404 PB - ACM CY - New York ER - TY - JOUR A1 - Herrmann, Frank A1 - Kirschner, Jan Michael A1 - Kleinert, Thomas A1 - Fritzsche, Harald T1 - Big Data im Bereich der technischen Sauberkeit JF - Anwendungen und Konzepte der Wirtschaftsinformatik (AKWI) N2 - Dieses Projekt befasst sich mit Fragestellungen zur Anwendung von künstlicher Intelligenz im Bereich der Technischen Sauberkeit. Durch Literaturforschungen, die einen Ablauf nach Fettke 2006 haben, werden KI-Anwendungen gesucht, die bereits im Zusammenhang mit der Technischen Sauberkeit verwendet werden. Die Forschungen konnten zwölf Literaturquellen ermitteln. Durch diese Literaturanalyse wurde festgestellt, dass 91 Prozent CV (Computer Vision) zur Partikelerkennung verwenden. Aus diesem Grund wurde anschließend ein CV Modell zur Partikelerkennung implementiert. Durch die Konfusionsmatrix konnte eine Treffergenauigkeit von 82 Prozent festgestellt werden. Daraus folgt, dass eine Partikelklassifikation möglich ist. Abschließend wurde eine weitere Literaturforschung zu Text Mining Applikationen durchgeführt, da der Bereich der Qualitätsanalyse im Monitoring laut Aufgabenstellung eingezogen werden sollte. In dieser konnte kein positives Ergebnis erzielt werden, da speziell nach fertigen Anwendungen gesucht wurde, die Analysetexte im Bereich der technischen Sauberkeit kategorisieren können. Y1 - 2021 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-30550 SN - 2296-4592 IS - 13 SP - 34 EP - 42 PB - Hochschule CY - Luzern ER - TY - CHAP A1 - Frikel, Jürgen A1 - Haltmeier, Markus ED - Dörfler, Willy ED - Hochbruck, Marlis ED - Hundertmark, Dirk ED - Reichel, Wolfgang ED - Rieder, Andreas T1 - Sparse Regularization of Inverse Problems by Operator-Adapted Frame Thresholding T2 - Mathematics of Wave Phenomena N2 - We analyze sparse frame based regularization of inverse problems by means of a diagonal frame decomposition (DFD) for the forward operator, which generalizes the SVD. The DFD allows to define a non-iterative (direct) operator-adapted frame thresholding approach which we show to provide a convergent regularization method with linear convergence rates. These results will be compared to the well-known analysis and synthesis variants of sparse ℓ1-regularization which are usually implemented thorough iterative schemes. If the frame is a basis (non-redundant case), the three versions of sparse regularization, namely synthesis and analysis variants of ℓ1-regularization as well as the DFD thresholding are equivalent. However, in the redundant case, those three approaches are pairwise different. Y1 - 2020 SN - 978-3-030-47173-6 SN - 978-3-030-47174-3 U6 - https://doi.org/10.1007/978-3-030-47174-3_10 SP - 163 EP - 178 PB - Birkhäuser; Springer International Publishing CY - Cham ET - 1st ed. ER - TY - CHAP A1 - Windbühler, Anna A1 - Okkesim, Sükrü A1 - Christ, Olaf A1 - Mottaghi, Soheil A1 - Rastogi, Shavika A1 - Schmuker, Michael A1 - Baumann, Timo A1 - Hofmann, Ulrich G. T1 - Machine Learning Approaches to Classify Anatomical Regions in Rodent Brain from High Density Recordings T2 - 44th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC 2022): 11-15 July 2022, Glasgow, Scotland, United Kingdom N2 - Identifying different functional regions during a brain surgery is a challenging task usually performed by highly specialized neurophysiologists. Progress in this field may be used to improve in situ brain navigation and will serve as an important building block to minimize the number of animals in preclinical brain research required by properly positioning implants intraoperatively. The study at hand aims to correlate recorded extracellular signals with the volume of origin by deep learning methods. Our work establishes connections between the position in the brain and recorded high-density neural signals. This was achieved by evaluating the performance of BLSTM, BGRU, QRNN and CNN neural network architectures on multisite electrophysiological data sets. All networks were able to successfully distinguish cortical and thalamic brain regions according to their respective neural signals. The BGRU provides the best results with an accuracy of 88.6 % and demonstrates that this classification task might be solved in higher detail while minimizing complex preprocessing steps. Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-35296 SP - 3530 EP - 3533 PB - IEEE ER - TY - CHAP A1 - Saha, Debjoy A1 - Nayak, Shravan A1 - Baumann, Timo T1 - Merkel Podcast Corpus: A Multimodal Dataset Compiled from 16 Years of Angela Merkel's Weekly Video Podcasts T2 - Proceedings of the 13th Conference on Language Resources and Evaluation (LREC 2022), Marseille, 20-25 June 2022 N2 - We introduce the Merkel Podcast Corpus, an audio-visual-text corpus in German collected from 16 years of (almost) weekly Internet podcasts of former German chancellor Angela Merkel. To the best of our knowledge, this is the first single speaker corpus in the German language consisting of audio, visual and text modalities of comparable size and temporal extent. We describe the methods used with which we have collected and edited the data which involves downloading the videos, transcripts and other metadata, forced alignment, performing active speaker recognition and face detection to finally curate the single speaker dataset consisting of utterances spoken by Angela Merkel. The proposed pipeline is general and can be used to curate other datasets of similar nature, such as talk show contents. Through various statistical analyses and applications of the dataset in talking face generation and TTS, we show the utility of the dataset. We argue that it is a valuable contribution to the research community, in particular, due to its realistic and challenging material at the boundary between prepared and spontaneous speech. Accepted at LREC 2022 KW - corpus KW - speaker diarization KW - multi-modal KW - forced alignment KW - single-speaker KW - cross-modal learning KW - German Y1 - 2022 UR - http://www.lrec-conf.org/proceedings/lrec2022/pdf/2022.lrec-1.270.pdf N1 - Preprint unter: https://arxiv.org/abs/2205.12194 SP - 2536 EP - 2540 ER - TY - CHAP A1 - Wintersperger, Karen A1 - Safi, Hila A1 - Mauerer, Wolfgang T1 - QPU-System Co-Design for Quantum HPC Accelerators? T2 - Architecture of Computing Systems: 35th International Conference, ARCS 2022, Heilbronn, Germany, September 13–15, 2022, Proceedings N2 - The use of quantum processing units (QPUs) promises speed-ups for solving computational problems, but the quantum devices currently available possess only a very limited number of qubits and suffer from considerable imperfections. One possibility to progress towards practical utility is to use a co-design approach: Problem formulation and algorithm, but also the physical QPU properties are tailored to the specific application. Since QPUs will likely be used as accelerators for classical computers, details of systemic integration into existing architectures are another lever to influence and improve the practical utility of QPUs. In this work, we investigate the influence of different parameters on the runtime of quantum programs on tailored hybrid CPU-QPU-systems. We study the influence of communication times between CPU and QPU, how adapting QPU designs influences quantum and overall execution performance, and how these factors interact. Using a simple model that allows for estimating which design choices should be subjected to optimisation for a given task, we provide an intuition to the HPC community on potentials and limitations of co-design approaches. We also discuss physical limitations for implementing the proposed changes on real quantum hardware devices. Y1 - 2022 SN - 978-3-031-21866-8 U6 - https://doi.org/10.1007/978-3-031-21867-5_7 N1 - Preprint unter: https://arxiv.org/abs/2208.11449 SP - 100 EP - 114 PB - Springer ER - TY - JOUR A1 - Davendra, Donald A1 - Herrmann, Frank A1 - Bialic-Davendra, Magdalena T1 - Chaotic Flower Pollination Algorithm for scheduling tardiness-constrained flow shop with simultaneously loaded stations JF - Neural computing & applications N2 - This paper introduces a novel chaotic flower pollination algorithm (CFPA) to solve a tardiness-constrained flow-shop scheduling problem with simultaneously loaded stations. This industrial manufacturing problem is modeled from a filter basket production line in Germany and has been generally solved using standard deterministic algorithms. This research develops a metaheuristic approach based on the highly efficient flower pollination algorithm coupled with different chaos maps for stochasticity. The objective function targeted is the tardiness constraint of the due dates. Fifteen different experiments with thirty scenarios are generated to mimic industrial conditions. The results are compared with the genetic algorithm and with the four standard benchmark priority rule-based deterministic algorithms of First In First Out, Raghu and Rajendran, Shortest Processing Time and Slack. From the obtained results and analysis of the relative difference, percentage relative difference and t tests, CFPA was found to be significantly better performing than the deterministic heuristics and the GA algorithm. KW - Flower pollination algorithm KW - Chaos maps KW - Flow shop with tardiness Y1 - 2022 U6 - https://doi.org/10.1007/s00521-022-08044-0 PB - Springer Nature ER - TY - BOOK A1 - Mauerer, Wolfgang T1 - Linux-Kernelarchitektur : Konzepte Strukturen und Algorithmen von Kernel 2.6 KW - Kernel KW - LINUX 2.6 Y1 - 2004 SN - 9783446225664 PB - Hanser CY - München ER -