TY - JOUR A1 - Engemann, Heiko A1 - Cönen, Patrick A1 - Dawar, Harshal A1 - Du, Shengzhi A1 - Kallweit, Stephan T1 - A robot-assisted large-scale inspection of wind turbine blades in manufacturing using an autonomous mobile manipulator JF - Applied Sciences N2 - Wind energy represents the dominant share of renewable energies. The rotor blades of a wind turbine are typically made from composite material, which withstands high forces during rotation. The huge dimensions of the rotor blades complicate the inspection processes in manufacturing. The automation of inspection processes has a great potential to increase the overall productivity and to create a consistent reliable database for each individual rotor blade. The focus of this paper is set on the process of rotor blade inspection automation by utilizing an autonomous mobile manipulator. The main innovations include a novel path planning strategy for zone-based navigation, which enables an intuitive right-hand or left-hand driving behavior in a shared human–robot workspace. In addition, we introduce a new method for surface orthogonal motion planning in connection with large-scale structures. An overall execution strategy controls the navigation and manipulation processes of the long-running inspection task. The implemented concepts are evaluated in simulation and applied in a real-use case including the tip of a rotor blade form. KW - mobile manipulation KW - large-scale inspection KW - wind turbine production KW - autonomous navigation KW - surface-orthogonal path planning Y1 - 2021 U6 - https://doi.org/10.3390/app11199271 SN - 2076-3417 N1 - Belongs to the Special Issue "Advances in Industrial Robotics and Intelligent Systems" VL - 11 IS - 19 SP - 1 EP - 22 PB - MDPI CY - Basel ER - TY - JOUR A1 - Maurischat, Andreas T1 - Algebraic independence of the Carlitz period and its hyperderivatives JF - Journal of Number Theory KW - Drinfeld modules KW - Periods KW - t-modules KW - Transcendence KW - Higher derivations Y1 - 2022 U6 - https://doi.org/10.1016/j.jnt.2022.01.006 SN - 0022-314X VL - 240 SP - 145 EP - 162 PB - Elsevier CY - Orlando, Fla. ER - TY - JOUR A1 - Schüller-Ruhl, Aaron A1 - Dinstühler, Leonard A1 - Senger, Thorsten A1 - Bergfeld, Stefan A1 - Ingenhag, Christian A1 - Fleischhaker, Robert ED - Mackenzie, Jacob T1 - Direct fabrication of arbitrary phase masks in optical glass via ultra-short pulsed laser writing of refractive index modifications JF - Applied Physics B N2 - We study the possibility to fabricate an arbitrary phase mask in a one-step laser-writing process inside the volume of an optical glass substrate. We derive the phase mask from a Gerchberg–Saxton-type algorithm as an array and create each individual phase shift using a refractive index modification of variable axial length. We realize the variable axial length by superimposing refractive index modifications induced by an ultra-short pulsed laser at different focusing depth. Each single modification is created by applying 1000 pulses with 15 μJ pulse energy at 100 kHz to a fixed spot of 25 μm diameter and the focus is then shifted axially in steps of 10 μm. With several proof-of-principle examples, we show the feasibility of our method. In particular, we identify the induced refractive index change to about a value of Δn=1.5⋅10−3. We also determine our current limitations by calculating the overlap in the form of a scalar product and we discuss possible future improvements. Y1 - 2022 U6 - https://doi.org/10.1007/s00340-022-07928-2 SN - 1432-0649 (Online) SN - 0946-2171 (Print) N1 - Corresponding author: Robert Fleischhaker VL - 128 IS - Article number: 208 SP - 1 EP - 11 PB - Springer CY - Berlin ER - TY - JOUR A1 - Philipp, Mohr A1 - Efthimiou, Nikos A1 - Pagano, Fiammetta A1 - Kratochwil, Nicolaus A1 - Pizzichemi, Marco A1 - Tsoumpas, Charalampos A1 - Auffray, Etiennette A1 - Ziemons, Karl T1 - Image reconstruction analysis for positron emission tomography with heterostructured scintillators JF - IEEE Transactions on Radiation and Plasma Medical Sciences N2 - The concept of structure engineering has been proposed for exploring the next generation of radiation detectors with improved performance. A TOF-PET geometry with heterostructured scintillators with a pixel size of 3.0×3.1×15 mm3 was simulated using Monte Carlo. The heterostructures consisted of alternating layers of BGO as a dense material with high stopping power and plastic (EJ232) as a fast light emitter. The detector time resolution was calculated as a function of the deposited and shared energy in both materials on an event-by-event basis. While sensitivity was reduced to 32% for 100 μm thick plastic layers and 52% for 50 μm, the CTR distribution improved to 204±49 ps and 220±41 ps respectively, compared to 276 ps that we considered for bulk BGO. The complex distribution of timing resolutions was accounted for in the reconstruction. We divided the events into three groups based on their CTR and modeled them with different Gaussian TOF kernels. On a NEMA IQ phantom, the heterostructures had better contrast recovery in early iterations. On the other hand, BGO achieved a better contrast to noise ratio (CNR) after the 15th iteration due to the higher sensitivity. The developed simulation and reconstruction methods constitute new tools for evaluating different detector designs with complex time responses. KW - TOF PET KW - Heterostructure KW - Metascintillator KW - Multiple TOF kernels KW - Image Reconstruction Y1 - 2022 U6 - https://doi.org/10.1109/TRPMS.2022.3208615 SN - 2469-7311 SN - 2469-7303 VL - 7 IS - 1 SP - 41 EP - 51 PB - IEEE CY - New York, NY ER - TY - JOUR A1 - Czarnecki, Christian A1 - Spiliopoulou, Myra T1 - A holistic framework for the implementation of a next generation network JF - International Journal of Business Information Systems N2 - As the potential of a next generation network (NGN) is recognised, telecommunication companies consider switching to it. Although the implementation of an NGN seems to be merely a modification of the network infrastructure, it may trigger or require changes in the whole company, because it builds upon the separation between service and transport, a flexible bundling of services to products and the streamlining of the IT infrastructure. We propose a holistic framework, structured into the layers ‘strategy’, ‘processes’ and ‘information systems’ and incorporate into each layer all concepts necessary for the implementation of an NGN, as well as the alignment of these concepts. As a first proof-of-concept for our framework we have performed a case study on the introduction of NGN in a large telecommunication company; we show that our framework captures all topics that are affected by an NGN implementation. KW - next generation network KW - telecommunication KW - NGN KW - IP-based networks KW - product bundling Y1 - 2012 U6 - https://doi.org/10.1504/IJBIS.2012.046291 SN - 1746-0972 VL - 9 IS - 4 SP - 385 EP - 401 PB - Inderscience Enterprises CY - Olney, Bucks ER - TY - JOUR A1 - Czarnecki, Christian A1 - Winkelmann, Axel A1 - Spiliopoulou, Myra T1 - Services in electronic telecommunication markets: a framework for planning the virtualization of processes JF - Electronic Markets N2 - The potential of electronic markets in enabling innovative product bundles through flexible and sustainable partnerships is not yet fully exploited in the telecommunication industry. One reason is that bundling requires seamless de-assembling and re-assembling of business processes, whilst processes in telecommunication companies are often product-dependent and hard to virtualize. We propose a framework for the planning of the virtualization of processes, intended to assist the decision maker in prioritizing the processes to be virtualized: (a) we transfer the virtualization pre-requisites stated by the Process Virtualization Theory in the context of customer-oriented processes in the telecommunication industry and assess their importance in this context, (b) we derive IT-oriented requirements for the removal of virtualization barriers and highlight their demand on changes at different levels of the organization. We present a first evaluation of our approach in a case study and report on lessons learned and further steps to be performed. KW - Telecommunication KW - Services KW - Process virtualization KW - Product bundling KW - Transformation Y1 - 2010 U6 - https://doi.org/10.1007/s12525-010-0045-8 SN - 1422-8890 VL - 20 IS - 3-4 SP - 197 EP - 207 PB - Springer CY - Berlin ER - TY - JOUR A1 - Baringhaus, Ludwig A1 - Gaigall, Daniel T1 - A goodness-of-fit test for the compound Poisson exponential model JF - Journal of Multivariate Analysis N2 - On the basis of bivariate data, assumed to be observations of independent copies of a random vector (S,N), we consider testing the hypothesis that the distribution of (S,N) belongs to the parametric class of distributions that arise with the compound Poisson exponential model. Typically, this model is used in stochastic hydrology, with N as the number of raindays, and S as total rainfall amount during a certain time period, or in actuarial science, with N as the number of losses, and S as total loss expenditure during a certain time period. The compound Poisson exponential model is characterized in the way that a specific transform associated with the distribution of (S,N) satisfies a certain differential equation. Mimicking the function part of this equation by substituting the empirical counterparts of the transform we obtain an expression the weighted integral of the square of which is used as test statistic. We deal with two variants of the latter, one of which being invariant under scale transformations of the S-part by fixed positive constants. Critical values are obtained by using a parametric bootstrap procedure. The asymptotic behavior of the tests is discussed. A simulation study demonstrates the performance of the tests in the finite sample case. The procedure is applied to rainfall data and to an actuarial dataset. A multivariate extension is also discussed. KW - Bootstrapping KW - Collective risk model Y1 - 2022 U6 - https://doi.org/10.1016/j.jmva.2022.105154 SN - 0047-259X SN - 1095-7243 VL - 195 IS - Article 105154 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Koster, Arie A1 - Scheidweiler, Robert A1 - Tieves, Martin T1 - A flow based pruning scheme for enumerative equitable coloring algorithms JF - A flow based pruning scheme for enumerative equitable coloring algorithms N2 - An equitable graph coloring is a proper vertex coloring of a graph G where the sizes of the color classes differ by at most one. The equitable chromatic number is the smallest number k such that G admits such equitable k-coloring. We focus on enumerative algorithms for the computation of the equitable coloring number and propose a general scheme to derive pruning rules for them: We show how the extendability of a partial coloring into an equitable coloring can be modeled via network flows. Thus, we obtain pruning rules which can be checked via flow algorithms. Computational experiments show that the search tree of enumerative algorithms can be significantly reduced in size by these rules and, in most instances, such naive approach even yields a faster algorithm. Moreover, the stability, i.e., the number of solved instances within a given time limit, is greatly improved. Since the execution of flow algorithms at each node of a search tree is time consuming, we derive arithmetic pruning rules (generalized Hall-conditions) from the network model. Adding these rules to an enumerative algorithm yields an even larger runtime improvement. Y1 - 2016 U6 - https://doi.org/10.48550/arXiv.1607.08754 N1 - Lehrstuhl II für Mathematik, RWTH Aachen University SP - 1 EP - 30 ER - TY - JOUR A1 - Beckenbach, Isabel A1 - Scheidweiler, Robert T1 - Perfect ƒ-Matchings and ƒ-Factors in Hypergraphs - A Combinatorial Approach JF - Discrete Mathematics N2 - We prove characterizations of the existence of perfect ƒ-matchings in uniform mengerian and perfect hypergraphs. Moreover, we investigate the ƒ-factor problem in balanced hypergraphs. For uniform balanced hypergraphs we prove two existence theorems with purely combinatorial arguments, whereas for non-uniform balanced hypergraphs we show that the ƒ-factor problem is NP-hard. Y1 - 2016 U6 - https://doi.org/10.1016/j.disc.2017.05.005 SN - 2192-7782 N1 - Als Volltext auch bei ZIB (Zuse Institute Berlin) VL - 240 IS - 10 SP - 2499 EP - 2506 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Scheidweiler, Robert A1 - Triesch, Eberhard T1 - A note on the duality between matchings and vertex covers in balanced hypergraphs JF - Journal of Combinatorial Optimization N2 - We present a new Min-Max theorem for an optimization problem closely connected to matchings and vertex covers in balanced hypergraphs. The result generalizes Kőnig’s Theorem (Berge and Las Vergnas in Ann N Y Acad Sci 175:32–40, 1970; Fulkerson et al. in Math Progr Study 1:120–132, 1974) and Hall’s Theorem (Conforti et al. in Combinatorica 16:325–329, 1996) for balanced hypergraphs. KW - Hall’s Theorem KW - Koenig’s Theorem KW - Duality KW - Balanced hypergraph KW - Hypergraph KW - Vertex cover KW - Matching Y1 - 2016 U6 - https://doi.org/10.1007/s10878-015-9887-5 SN - 1573-2886 N1 - Lehrstuhl II für Mathematik RWTH Aachen VL - 32 IS - 2 SP - 639 EP - 644 PB - Springer CY - Berlin ER -