Kolloquiumsvortrag, Prof. Tamas Kerekes, Aalborg University Denmark / am 13.02.2017

13.02.2017 von 17:15 bis 18:45 – Technische Fakultät, Institut für Elektrotechnik und Informationstechnik, Kaiserstr. 2, Kiel, Raum: "Aquarium", Geb. D

Sonderkolloquium Prof. Concari, University of Parma / am 21.02.2017

21.02.2017 von 15:00 bis 16:30

Technische Fakultät, Kaiserstr. 2, Kiel, Raum: "Aquarium", Geb. D

Titel: Fault Diagnosis of Electrical Machines

Abstract: The fault diagnosis of electrical machines has been the subject of intensive research for several decades. Being able to detect or predict incipient faults before they impair the ability of the machines to function properly is a very welcome feature in industrial environments, where unscheduled downtime can cause production and financial loss.

Electrical machine faults include electrical stator faults, electrical rotor faults, eccentricity, bearing faults. Diagnostic techniques for the detection of such faults in electrical machines are reviewed, and their effectivity is assessed in different operating conditions, including closed-loop inverter-fed operation. Furthermore, the impact of wide-bandgap devices is discussed and prognostic techniques are reviewed, with particular focus on aerospace applications.

Girls' Day am 27.04.2017

27.04.2017 von 09:00 bis 09:00

Technische Fakultät, Kaiserstraße 2, 24143 Kiel sowie Christian-Albrechtsplatz 2, 24118 Kiel

Kolloquiumsvortrag, Dipl.-Ing. Ingo Schalk-Schupp, Forschungslabor Nuance Communication / am 10.04.2017

10.04.2017 von 17:15 bis 18:45

Institute Ostufer, Geb. D, "Aquarium", Kaiserstr. 2, 24143 Kiel

Titel: Nonlinear Echo Suppression

Abstract: This presentation provides a short overview concerning acoustic echo cancellation and acoustic echo suppression methods followed by a more in-depth discussion of new methods dealing with Hammerstein-type nonlinear distortions.

The Hammerstein system is divided into a linear and a parallel nonlinear part by an alternative way to define of the linear one. The implications of this separation definition and its relation to linear acoustic echo cancellation are illuminated.

Based on this approach, and assuming a converged linear echo canceller, a suppression approach for nonlinearly distorted acoustic echo signal components is introduced, the essential component of which is the nonlinear echo power spectral density estimation, which depends on one unknown real scalar parameter.

Subsequently, an identification algorithm for said parameter is presented, which results in a usable nonlinear echo suppressor still under the assumption of a converged linear echo canceller. Moreover, a generic comprehensive evaluation method for suppressor-type algorithms is advertised.

Finally, the challenge of concurrently adaptive linear echo canceller and nonlinear echo suppressor is analyzed and a solution for a full system is presented. After listening to several audio examples, the audience is invited to discuss the presentation’s contents.

Short biography

Ingo Schalk-Schupp studied systems engineering and technical cybernetics at Otto von Guericke University in Magdeburg, Germany. He graduated as a diploma engineer (Diplomingenieur) in 2012 with a diploma thesis titled “Speech Signal Enhancement in Automotive Environments” composed at Nuance Communications in Ulm, Germany. The thesis comprised two patent applications and was granted the best thesis award by the “Magdeburger Kybernetiker e.V.” Since 2012, he has been a PhD student with Nuance in Ulm and is supervised by Professor Andreas Wendemuth, Chair of Cognitive Systems at Otto von Guericke University Magdeburg. This presentation reflects the author’s findings from his PhD research.

Sonderkolloquium, Dr. Chidambaram Amalai, ETH Zürich / am 10.04.2017

10.04.2017 von 15:00 bis 16:30

Ludewig-Meyn-Str. 2. Raum Ü2/K (LMS2, R. Ü2/K)

Titel: Algorithmic Advances in Allocation and Scheduling

Abstract: We study the restricted case of Scheduling on Unrelated Parallel
Machines. In this problem, we are given a set of jobs J with processing
times p_j and each job may be scheduled only on some subset of machines
S_j. The goal is to find an assignment of jobs to machines to minimize
the time by which all jobs can be processed. In a seminal paper,
Lenstra, Shmoys, and Tardos designed an elegant 2-approximation for the
problem in 1987. The question of whether approximation algorithms with
better guarantees exist for this classic scheduling problem has since
remained a source of mystery.

In recent years, with the improvement of our understanding of
Configuration LPs, it now appears an attainable goal to design such an
algorithm. Our main contribution is to make progress towards this goal.
When the processing times of jobs are either 1 or epsilon < 1, we design
an approximation algorithm whose guarantee tends to 1+sqrt(3)/2 =
1.8660254, for the interesting cases when epsilon approaches 0. This
improves on the 2 - epsilon_0 guarantee recently obtained by
Chakrabarty, Khanna, and Li for some constant epsilon_0 > 0.

Kolloquiumsvortrag, M. Sc. Alexander Mäcker, Universität Paderborn / am 21.04.2017

21.04.2017 von 14:15 bis 15:45

Institut für Informatik, Ludewig-Meyn-Straße 2, 24118 Kiel, Raum: Übungsraum 2/K

Titel: Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times

Abstract: Consider a problem in which $n$ jobs that are classified into $k$ types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time. The machine requires a setup taking $s$ time units whenever it switches from processing jobs of one type to jobs of a different type. We consider the problem as an online problem where each job is only known to the scheduler as soon as it arrives and where the processing time of a job only becomes known upon its completion (non-clairvoyance). We analyze a simple modification of the FIFO strategy and show the competitiveness to be $\Theta(\sqrt{n})$, which is optimal for greedy-like'' algorithms. We will then also consider a smoothed analysis of the competitiveness. The smoothed competitiveness turns out to only be $O(\varepsilon^{-2} \log^2 n)$ when processing times $p_j$ are independently perturbed by adding a random value uniformly drawn from $[-\varepsilon p_j, \varepsilon p_j]$, $0 < \varepsilon < 1$. The talk is based on joint work with Manuel Malatyali and Sören Riechers.

Kolloquiumsvortrag, Prof. Massimo Guarnieri, University Padua (Italien) / am 24.04.2017

Aktuelle Meldungen

Forschung & Projekte

•

Kalender

Mo Di Mi Do Fr Sa So « April 2017 » 27 28 29 30 12:30: Technische Fakultät organisiert erneut Siegerehrung des Landeswettbewerbs „Jugend forscht – Schüler experimentieren“ Klicken Sie, um Details zu allen 1 Terminen zu sehen. 31 1 2 3 4 5 6 7 8 9 10 15:00: Sonderkolloquium, Dr. Chidambaram Amalai, ETH Zürich / am 10.04.2017 17:15: Kolloquiumsvortrag, Dipl.-Ing. Ingo Schalk-Schupp, Forschungslabor Nuance Communication / am 10.04.2017 Klicken Sie, um Details zu allen 2 Terminen zu sehen. 11 12 13 14 15 16 17 18 19 20 21 14:15: Kolloquiumsvortrag, M. Sc. Alexander Mäcker, Universität Paderborn / am 21.04.2017 Klicken Sie, um Details zu allen 1 Terminen zu sehen. 22 23 24 17:15: Kolloquiumsvortrag, Prof. Massimo Guarnieri, University Padua (Italien) / am 24.04.2017 Klicken Sie, um Details zu allen 1 Terminen zu sehen. 25 26 27 09:00: Girls' Day am 27.04.2017 Klicken Sie, um Details zu allen 1 Terminen zu sehen. 28 29 30