TY  - CHAP
A1  - Kilic, S. A.
A1  - Raatschen, Hans-Jürgen
A1  - Astaneh-Asl, A.
A1  - Apaydin, N. M.
T1  - Finite element modeling of the Fatih Sultan Mehmet Suspension Bridge
T2  - Multi-Span Large Bridges - Proceedings of the International Conference on Multi-Span Large Bridges
Y1  - 2015
SN  - 9781138027572
SP  - 1169
EP  - 1173
PB  - CRC Press
CY  - Leiden
ER  - 
TY  - CHAP
A1  - Wollert, Jörg
T1  - Industrie 4.0 - warten bis die Revolution vorbei ist?
T2  - Automatisierung im Fokus von Industrie 4.0 : Tagungsband AALE 2016 ; 13. Fachkonferenz, Lübeck
Y1  - 2016
SN  - 978-3-8356-7312-0
N1  - AALE-Konferenz <13., 2016, Lübeck>
SP  - 127
EP  - 136
PB  - DIV Deutscher Industrieverlag GmbH
CY  - München
ER  - 
TY  - CHAP
A1  - Kallweit, Stephan
A1  - Schleupen, Josef
A1  - Dahmann, Peter
A1  - Bagheri, Mohsen
A1  - Engemann, Heiko
T1  - Entwicklung eines Kletterroboters zur Diagnose und Instandsetzung von Windenergieanlagen (SMART)
T2  - Automatisierung im Fokus von Industrie 4.0 : Tagungsband AALE 2016 ; 13. Fachkonferenz, Lübeck
Y1  - 2016
SN  - 978-3-8356-7312-0
N1  - AALE-Konferenz <13., 2016, Lübeck>
SP  - 207
EP  - 212
PB  - DIV Deutscher Industrieverlag GmbH
CY  - München
ER  - 
TY  - CHAP
A1  - Wollert, Jörg
T1  - Wireless systems for machinery safety : Requirements and solutions for wireless real time systems
T2  - 16th International Conference on Research and Education in Mechatronics (REM), 2015
Y1  - 2015
SN  - 978-3-945728-01-7
U6  - http://dx.doi.org/10.1109/REM.2015.7380377
SP  - 88
EP  - 91
ER  - 
TY  - CHAP
A1  - Nakagawa, Masaki
A1  - Kallweit, Stephan
A1  - Michaux, Frank
A1  - Hojo, Teppei
T1  - Typical Velocity Fields and Vortical Structures around a Formula One Car, based on Experimental Investigations using Particle Image Velocimetry
T2  - SAE International Journal of Passenger Cars - Mechanical Systems
Y1  - 2016
U6  - http://dx.doi.org/10.4271/2016-01-1611
SN  - 1946-4002
ER  - 
TY  - JOUR
A1  - Wollert, Jörg
T1  - Rapid Application Development
JF  - Design & Elektronik
N2  - Das IoT ist ohne eingebettete Systeme undenkbar. Erst kleine und kleinste Mikrocontroller mit intelligenten Kommunikationsschnittstellen und Anbindung ans Internet ermöglichen sinnvolles und flächendeckendes Einsammeln von Daten. Doch wie kompliziert ist der Einstieg in die Embedded-Welt? Dieser Artikel gibt Einblick, wie die »Arduino-Plattform« die Einstiegshürden für eingebettete Systeme dramatisch reduzieren kann.
Y1  - 2016
SN  - 0933-8667
IS  - 4
SP  - 8
EP  - 11
PB  - WEKA-Fachmedien
CY  - München
ER  - 
TY  - JOUR
A1  - Wollert, Jörg
T1  - Industrial Internet of Things : Seifenblase oder Revolution
JF  - Elektronik
Y1  - 2016
SN  - 0013-5658
N1  - gedruckt in der Bereichsbibliothek Eupener Str. unter der Signatur Z 263
IS  - 7
SP  - 39
EP  - 45
PB  - WEKA-Fachmedien
CY  - München
ER  - 
TY  - BOOK
A1  - Gebhardt, Andreas
A1  - Hötter, Jan-Steffen
T1  - Additive manufacturing : 3D printing for prototyping and manufacturing
Y1  - 2016
SN  - 978-1-56990-582-1 ; 978-1-56990-583-8
PB  - Hanser Publishers
CY  - Munich
ER  - 
TY  - BOOK
A1  - Gebhardt, Andreas
A1  - Kessler, Julia
A1  - Thurn, Laura
T1  - 3D-Drucken: Grundlagen und Anwendungen des additive manufacturing (AM)
Y1  - 2016
SN  - 978-3-446-44672-4
U6  - http://dx.doi.org/10.3139/9783446448452
PB  - Hanser
CY  - München
ET  - 2., neu bearbeitete und erweiterte Auflage
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  - http://dx.doi.org/10.48550/arXiv.1607.08754
N1  - Lehrstuhl II für Mathematik, RWTH Aachen University
SP  - 1
EP  - 30
ER  -