@phdthesis{Legde2021, author = {Legde, Katharina}, title = {Projecting motion capture : designing and implementing a modular and flexible facial animation pipeline to evaluate different perceptual effects}, doi = {10.26127/BTUOpen-5604}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-56043}, school = {BTU Cottbus - Senftenberg}, year = {2021}, abstract = {We can not not communicate, humans use body language and facial expressions to communicate verbally and non-verbally with others. Humans are experts at deciphering and understanding facial expressions. Thus, synthesizing them on a virtual face becomes a very challenging task. Realistic facial animations have various applications like movies, games or affective interfaces. Often motion capture recordings of real humans are used to provide the virtual face with realistic motion. Animation controls need to be established to transfer the captured motion onto the virtual face. To mimic the full essence of the captured motion, these animation controls need to be carefully planned beforehand which is accompanied with high effort in terms of spent time and money. The presented thesis would like to offer an alternative approach to the common performance-driven facial animation techniques. Instead of using motion capture to drive a pre-defined blend-shape rig, this thesis projects motion capture directly onto a facial mesh. Throughout the proposed pipeline, different methods for retargeting, rigging and skinning are evaluated. Special attention is given to the fact that the origin of motion capture and the appearance of the virtual face does not need to be identical. A constraint for this approach to work is clean motion capture data. For that, this thesis offers an automatic way to clean facial motion trajectories and establishes stable and coherent motion curves. To not just give insights about the capability of the proposed pipeline but also to provide valuable results in the field of perception of virtual avatars, perceptual experiments are conducted. These experiments reveal the functionality of the pipeline and show that it is possible to re-use motion capture on different virtual faces. Additionally, the proposed pipeline is used as a tool to investigate into the perception of non-verbal communication for virtual avatars.}, subject = {Facial animation; Motion capture; Retargeting; Skinning; Perception; Gesichtsanimation; Motion Capture; Retargeting; Skinning; Wahrnehmung; Gesichtserkennung; Mimik; Merkmalsextraktion; Motion Capturing}, language = {en} } @misc{OPUS4-5869, title = {Amtliches Mitteilungsblatt der BTU Cottbus-Senftenberg, 2022,5 (30.03.2022)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-58699}, year = {2022}, abstract = {Habilitationsordnung der Fakult{\"a}t f{\"u}r Gesundheitswissenschaften in Gr{\"u}ndung, gemeinsame Fakult{\"a}t der Universit{\"a}t Potsdam, der Medizinischen Hochschule Brandenburg Theodor Fontane und der Brandenburgischen Technischen Universit{\"a}t Cottbus-Senftenberg vom 29. M{\"a}rz 2022}, language = {de} } @misc{OPUS4-5946, title = {Amtliches Mitteilungsblatt der BTU Cottbus-Senftenberg, 2022,7 (22.06.2022)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-59469}, year = {2022}, abstract = {Erste {\"A}nderungssatzung zur Promotionsordnung der Fakult{\"a}t 1 - MINT- Mathematik, Informatik, Physik, Elektro- und Informationstechnik vom 15. Juni 2022 (erg{\"a}nzt AMbl 02/2018)}, language = {de} } @phdthesis{Lehrack2016, author = {Lehrack, Sebastian}, title = {Efficient and flexible lineage construction for probabilistic databases}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-40460}, school = {BTU Cottbus - Senftenberg}, year = {2016}, abstract = {In contrast to traditional data applications, many real-world scenarios nowadays depend on managing and querying huge volumes of uncertain and incomplete data. This new type of applications emerge, for example, when we integrate data from various sources, analyse social/biological/chemical networks or conduct privacy-preserving data mining. A very promising concept addressing this new kind of probabilistic data applications has been proposed in the form of probabilistic databases. Here, a tuple only belongs to its table or query answer with a specific likelihood. That probability expresses the uncertainty about the given data or the confidence in the answer. The most challenging task for probabilistic databases is query evaluation. In fact, there are even simple relational queries for which determining the occurrence probability of a single answer tuple is hard for \#P. Lineage formulas constitute the central concept under investigation in this work. In short, the mechanism behind lineage formulas facilitates the representation and evaluation of events of the probability space, which is defined by a probabilistic database. On the basis of lineage formulas, we devise a framework that is designed as a combination of a relational database layer and an additional probabilistic query engine. In particular, the following three aspects are studied: (i) an efficient construction of lineage formulas, (ii) an orthogonal combination of lineage optimization techniques, which are performed within the relational database layer and the probabilistic query engine, and (iii) effective and compact data structures to represent lineage formulas within a probabilistic query engine. The developed framework provides a novel lineage construction method that is able to construct nested lineage formulas, to avoid large tuple sets within the relational database layer tuples, and to provide full relational algebra support. In addition, the proposed system completely resolves the conflict between the contradicting query plans optimized for the relational database layer and the probabilistic query engine.}, subject = {Probabilistic database; Lineage formula; Query evaluation; Uncertainty; Query optimization; Probabilistische Datenbank; Abstammungsformel; Anfrageauswertung; Unsicherheit; Anfrageoptimierung; Probabilistisches Datenbanksystem; Unsicherheit}, language = {en} } @misc{OPUS4-4139, title = {Amtliches Mitteilungsblatt der BTU Cottbus - Senftenberg, 2017,7 (23.02.2017)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-41395}, year = {2017}, abstract = {Berichtung der fachspezifischen Pr{\"u}fungs- und Studienordnung f{\"u}r den Bachelor-Studiengang Stadt- und Regionalplanung vom 27. September 2016 Fachspezifische Pr{\"u}fungs- und Studienordnung f{\"u}r den Bachelor-Studiengang Stadt- und Regionalplanung vom 27. September 2016 (Lesefassung nach Berichtigung) (s. AMbl 12/2019)}, language = {de} } @misc{OPUS4-4140, title = {Amtliches Mitteilungsblatt der BTU Cottbus - Senftenberg, 2017,8 (23.02.2017)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-41401}, year = {2017}, abstract = {Satzung zur Anerkennung wissenschaftlicher Einrichtungen außerhalb der Brandenburgischen Technischen Universit{\"a}t Cottbus - Senftenberg (BTU) als An-Institute (Satzung An-Institute) vom 15. Dezember 2016}, language = {de} } @misc{OPUS4-4199, title = {Amtliches Mitteilungsblatt der BTU Cottbus - Senftenberg, 2017,11 (19.05.2017)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-41994}, year = {2017}, abstract = {Erste {\"A}nderungssatzung der Wahlordnung der Brandenburgischen Technischen Universit{\"a}t Cottbus - Senftenberg (WahlO BTU) vom 17. November 2016 Wahlordnung der Brandenburgischen Technischen Universit{\"a}t Cottbus - Senftenberg vom 08. Januar 2016 (AMbl. 02/2016 vom 08. Januar 2016), ge{\"a}ndert durch die 1. {\"A}nderungssatzung vom 17. November 2016 (AMbl.11/2017 vom 19. Mai 2017) WahlO BTU - Neufassung WahlO BTU -}, language = {de} } @misc{OPUS4-4198, title = {Amtliches Mitteilungsblatt der BTU Cottbus - Senftenberg, 2017,10 (19.05.2017)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-41988}, year = {2017}, abstract = {Satzung {\"u}ber die Durchf{\"u}hrung des Auswahlverfahrens im Bachelor-Studiengang Soziale Arbeit (AuswahlSa BA Soziale Arbeit) vom 18. Mai 2017 Satzung {\"u}ber die Durchf{\"u}hrung des Auswahlverfahrens im Master-Studiengang Soziale Arbeit (AuswahlSa MA Soziale Arbeit) vom 18. Mai 2017 s. Erg{\"a}nzung dazu AMbl. 01/2017}, language = {de} } @misc{OPUS4-4170, title = {Amtliches Mitteilungsblatt der BTU Cottbus - Senftenberg, 2017,9 (10.04.2017)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-41700}, year = {2017}, abstract = {Zweite {\"A}nderungssatzung zu Teil B des Bachelor-Studienganges Biotechnologie vom 28. August 2014 Ersetzt Artikel 13 der Pr{\"u}fungs- und Studienordnung des Bachelor-Studienganges Biotechnologie an der BTU vom 04. Juni 2011 (Mitteilungsblatt Nr. 219)}, language = {de} } @misc{OPUS4-4240, title = {Amtliches Mitteilungsblatt der BTU Cottbus - Senftenberg, 2017,13 (30.06.2017)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-42403}, year = {2017}, abstract = {Leitfaden zur Anwendung einer geschlechtersensiblen Sprache an der BTU Cottbus - Senftenberg}, language = {de} } @misc{OPUS4-4126, title = {Amtliches Mitteilungsblatt der BTU Cottbus - Senftenberg, 2017,6 (15.02.2017)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-41262}, year = {2017}, abstract = {Satzung zur Evaluation von Lehre und Studium im Rahmen des Qualit{\"a}tsmanagements an der Brandenburgischen Technischen Universit{\"a}t Cottbus - Senftenberg vom 14. Februar 2017 (Ersetzt "Satzung {\"u}ber die Lehrevaluation an der Fachhochschule Lausitz" der ehemaligen Hochschule Lausitz vom 06. Juni 2005) (Ersetzt durch AMbl. 13/2020)}, language = {de} } @misc{OPUS4-4233, title = {Amtliches Mitteilungsblatt der BTU Cottbus - Senftenberg, 2017,12 (21.06.2017)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-42338}, year = {2017}, abstract = {Erste {\"A}nderungssatzung der Grundordnung f{\"u}r die Brandenburgische Technische Universit{\"a}t Cottbus - Senftenberg (GO BTU) vom 17. November 2016 Grundordnung f{\"u}r die Brandenburgische Technische Universit{\"a}t Cottbus - Senftenberg (GO BTU) vom 08. Januar 2016 (AMbl. 01/2016 vom 08. Januar 2016), ge{\"a}ndert durch die 1. {\"A}nderungssatzung vom 17. November 2016 (AMbl. 12/2017 vom 21. Juni 2017) (GO BTU) - Neufassung GO BTU - (s. dazu 2. {\"A}S GO BTU AMbl 24/2022)}, language = {de} } @phdthesis{Chodak2021, author = {Chodak, Jacek}, title = {Spike - a tool for reproducible simulation experiments}, doi = {10.26127/BTUOpen-5850}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-58509}, school = {BTU Cottbus - Senftenberg}, year = {2021}, abstract = {Reproducibility of simulation experiments is still a significant challenge and has attracted considerable attention in recent years. One cause of this situation is bad habits of the scientific community. Many results are published without data or source code, and only a textual description of the simulation set-up is provided. Other causes are: no complete simulation set-up, no proper output data analysis and inconsistency of published data, which makes it impossible to compare results. The progress of computational modelling, amount of data and complexity of models requires designing experiments in such a way that ensures reproducibility. A textual description does not provide all the needed details. A computer code is more reliable than a textual description. It is the precise specification that describes a simulation configuration, model, etc. When computer code, data, models and all parameters are provided, the simulation results become reproducible. The main goal of this thesis is to develop a tool that ensures reproducibility and efficient execution of simulation experiments, often involving many individual simulation runs. The tool should support a wide range of application scenarios, where the typical scenario is simulation of biochemical reaction networks, which are represented as (coloured) Petri nets interpreted in the stochastic, continuous or hybrid paradigm. The model to be simulated can be given in various formats, including SBML. The result is a command line tool called Spike, which can be used for various scenarios, including benchmarking, simulation of adaptive models and parameter optimization. It builds on a human-readable configuration script SPC, supporting the efficient specification of multiple model configurations as well as multiple simulator configurations in a single configuration file.}, subject = {Petri nets; Parallel simulation; Parameter scanning; Reproducibility; Simulation of adaptive models; Petri Netze; Parallelsimulation; Parameterscannen; Reproduzierbarkeit; Simulation von adaptiven Modellen; Gef{\"a}rbtes Petri-Netz; Simulation; Reproduzierbarkeit}, language = {en} } @incollection{JavedScheyttBamidietal., author = {Javed, Abdul Rehman and Scheytt, J. Christoph and Bamidi, Eswara Rao and Kallfass, Ingmar and Krishnegowda, Karthik and Kraemer, Rolf}, title = {Real100G.COM}, series = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, booktitle = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, doi = {10.26127/BTUOpen-5914}, publisher = {BTU Cottbus - Senftenberg}, pages = {231 -- 293}, abstract = {In 2012 a group of researchers proposed a basic research initiative to the German Research Foundation (DFG) as a special priority project (SPP) with the name: Wireless 100 Gbps and beyond. The main goal of this initiative was the investigation of architectures, technologies and methods to go well beyond the state of the art. The target of 100 Gbps was set far away from the (at that time) achievable 1 Gbps such that it was not possible to achieve promising results just by tuning some parameters. We wanted to find breakthrough solutions. When we started the work on the proposal we discussed the challenges to be addressed in order to advancing the wireless communication speed significantly. Having the fundamental Shannon boundary in mind we discussed how to achieve the 100 Gbps speed.}, subject = {100 Gbps; Wireless; Drahtlos; Real100G.COM; PSSS; Drahtloses Sensorsystem; Hochfrequenztechnik; Antenne; Terahertzbereich; Energieffizienz}, language = {en} } @phdthesis{SegabinazziFerreira2022, author = {Segabinazzi Ferreira, Raphael}, title = {Run-time redundancy management of processor functional units for mixed-critical scenarios}, doi = {10.26127/BTUOpen-5888}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-58886}, school = {BTU Cottbus - Senftenberg}, year = {2022}, abstract = {Since electronics started to scale down, a growing concern about the reliability of these electronic devices has emerged. At the same time, the increased demand for high performance within the safety- and mixed-critical domains, such as the aerospace and automotive industry, motivated a shift from previous consolidated and mature technology to the new cutting edge devices with smaller feature sizes. Therefore, there is a need to improve the fault tolerance of these high-end devices so that minimum failure rates can be obeyed. Although redundancy has been a great solution for these problems, their drawbacks such as power and area overheads must be watched carefully, so that per-unit price does not extrapolate affordable limits, and the redundancy does not add more sources of error than it improves the fault tolerance. This thesis proposes an approach for run-time management of redundancy among the processor internal Functional Units (FUs) within mixed-critical scenarios, tackling the compensation of the trade-offs between fault-tolerance, power consumption, hardware usage (ageing), and hardware area (cost). With these objectives in mind, this thesis presents a concept for a dynamic processor architecture capable to enable and disable redundancy of FUs on-demand, and a software mechanism for criticality-aware management of these units for mixed-critical processes within an Operating System (OS). For this purpose, a processor design was extended with a few additional instructions that enabled different replication schemes in the processor at run-time. Furthermore, a compatible Real-Time Operating System (RTOS) is also extended to enable the desired criticality-aware management of units. Evaluating the implemented test platform when the extended processor was running bare-metal code, the latency to shift between different replication schemes was of only one instructions cycle. Furthermore, when the processor was running the adapted RTOS, the run-time overhead over the latency to switch between processes remained below 2.5\%. Meanwhile, resulting from the processor extensions, the hardware overhead remained smaller than standard full core replication schemes such as core lock-step approaches. Regarding fault tolerance, the expected failure rate of the FUs module decreased by approximately 80\% when its FUs were configured with Triple Modular Redundancy (TMR). Furthermore, when considering the whole area of the processor core, its respective failure rate decreased by about 15\% when configured these units with the same triplication scheme. Finally, it is also presented that the run-time management of FUs was likewise able to decrease the power consumption and hardware ageing for the proposed mixed-critical scenario. After all, we can say that the concept can increase fault tolerance on-demand of a processor design with moderately low hardware overhead, while it also minimises the power consumption and hardware usage (ageing) for its intended mixed-critical scenario.}, subject = {Mixed-critical scenario; Redundancy; Fault-tolerance; Run-time; Fehlertoleranz; Redundanz; Funktionseinheit; Mikroprozessor; Laufzeit; Gemischtkritische Szenarien; Laufzeit; Redundanz}, language = {en} } @phdthesis{Gaebler2019, author = {G{\"a}bler, Jan}, title = {Gruppenkommunikation in mobilen Umgebungen : eine Erweiterung des Gruppenkommunikationsparadigmas um eine Unterst{\"u}tzung f{\"u}r mobile Anwendungsnutzer}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-48750}, school = {BTU Cottbus - Senftenberg}, year = {2019}, abstract = {Mit der zunehmenden mobilen Nutzung des Internets steigt auch die Zahl von Anwendungen in mobilen Umgebungen. Diese sind neben ihren spezifischen Anforderungen oft durch eine enge Kooperation ihrer Nutzer gekennzeichnet. Werden mobile verteilte Entscheidungsprozesse modelliert, welche der Bewertung von Sachverhalten oder der L{\"o}sung von Aufgaben dienen, so nennt man diese Klasse von Anwendungen mobile kollaborative Anwendungen. Sie werden in dieser Arbeit eingef{\"u}hrt. Ihre Eigenschaften und Besonderheiten werden diskutiert. Die Teilnehmer solcher Anwendungen kollaborieren innerhalb einer geschlossenen Gruppe und bauen ein gemeinsames Wissen auf. Auf dessen Basis kann die Anwendung lokale Entscheidungen treffen, {\"u}ber die in der Gruppe Konsens besteht. Die instabile Kommunikation in mobilen Umgebungen stellt jedoch an die Sicherung der Konsistenz des gemeinsamen Wissens besondere Anforderungen. Da klassische Verfahren zur Konsistenzsicherung in gruppenorientierten Systemen nicht genutzt werden k{\"o}nnen, ist die Sicherung der Konsistenz des globalen Wissens in mobilen Umgebungen das Leitthema dieser Arbeit. Es wird ein gruppenorientierter Kommunikationsdienst - Moversight genannt - f{\"u}r mobile kollaborative Anwendungen vorgestellt, welcher ihnen ein konsistentes globales Wissen trotz instabilen Kommunikationsumfeldes bereitstellt. Hinzu kommt, dass neben der Konsistenzsicherung die Diensterbringung in einer ressourcenschonenden Art und Weise bei gleichzeitiger kontinuierlicher Adaption der Gruppe an sich {\"a}ndernde Bedingungen einschließlich der Wartung ihrer Kommunikationsstrukturen gesichert werden m{\"u}ssen. Der Protokollentwurf f{\"u}r Moversight wird in dieser Arbeit vorgestellt. F{\"u}r Moversight wurden neuartige Funktionen zur Behandlung der Nutzermobilit{\"a}t entwickelt, welche mit den notwendigen Mechanismen zur Sicherung der Konsistenz des gemeinsamen Wissens interagieren. Ohne Gegenmaßnahmen w{\"u}rden h{\"a}ufige Verbindungsunterbrechungen das gemeinsame Wissen der Gruppe zerst{\"o}ren, wodurch diese logisch partitioniert und letztlich die Kollaboration der Nutzer verhindert wird. Grundlage der Sicherung des gemeinsamen Wissens ist die mobile optimistische virtuelle Synchronit{\"a}t (MOVS), welche das {\"u}bliche gruppenorientierte Modell der Wissenssicherung um eine Behandlung der Nutzermobilit{\"a}t und variierender Verbindungseigenschaften der Gruppenteilnehmer erweitert. Dadurch k{\"o}nnen Teilnehmer bei Verbindungsproblemen zeitnah in die Gruppe zur{\"u}ckzukehren und ihr Wissen mit dieser abzugleichen. Das vorgestellte Konzept zur Erkennung und Behandlung von Fehlersituationen mit anschließendem Gruppenwiedereintritt ist deutlich leistungsf{\"a}higer als das {\"u}blicherweise verwendete Verfahren. Dies wird erreicht durch eine leichtgewichtige Fehlerdetektion unter Nutzung einer neuartigen verteilten Latenzsch{\"a}tzung sowie einer kontinuierlichen Adaption der verwendeten Kommunikationstopologie an die sich permanent {\"a}ndernden Kommunikationsbedingungen. Die entwickelte Optimierung der clusterbasierten Kommunikationstopologie eignet sich f{\"u}r alle gruppenorientierten clusterbasierten Anwendungsszenarien. Dar{\"u}ber hinaus verf{\"u}gt Moversight {\"u}ber kollaborative Dienste f{\"u}r das Teilen und Vereinigen von Gruppen, wie sie bisher in keinem gruppenorientierten Kommunikationsdienst zu finden sind. Beide Dienste erm{\"o}glichen eine anwendungsgetriebene Neustrukturierung der kollaborativen Gruppe bei gleichzeitiger Sicherung des globalen Wissens.}, subject = {Gruppenkommunikation; uBeeMe; Virtuelle Synchronit{\"a}t; Mobile Nutzer; Group communication; Moversight; Virtual synchrony; Mobile user; Computer Supported Cooperative Work; Synchronisierung; Mobilit{\"a}t; Gruppenkommunikation }, language = {de} } @phdthesis{Khanian2018, author = {Khanian, Maryam}, title = {3D reconstruction using generalized perspective photometric stereo}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-47191}, school = {BTU Cottbus - Senftenberg}, year = {2018}, abstract = {Reconstruction of the 3D shape information is a fundamental problem in computer vision. Among different shape recovering technologies, photometric stereo is highlighted for its capability to produce high quality 3D reconstruction. This dissertation generalizes photometric stereo in different aspects towards creating a practical 3D reconstruction. The proposed techniques can be considered as a fundamental support to develop future cameras offering 3D shapes for various applications such as movie and video game industry, medical sciences, virtual reality, automotive driving and etc. The first generalization is developed for addressing specularities in 3D reconstructions and also involving the perspective projection. These attempts lead to remove the limitation of working with diffuse materials and confined projected scenes. We will prove the applicability of our approach using complex scenes like endoscopy images. In the second proposed approach, we will offer a real-time 3D reconstruction of micro-details with a more generalized reflectance model. Moreover, a recurrent optimization network will be provided. These innovations lead to presenting the 3D reconstruction of details which are even invisible to human eyes like micro-prints on the banknote. This information recovery can be used in various areas such as detecting security items on financial documents for fraud detection and also the quality control of any industrial productions including delicate details such as printed circuits. In the third proposed model, we develop a PS reconstruction technique using neural networks for the uncalibrated PS where the light direction is not available. Finally, for the first time, benefiting from deep neural networks and meta heuristic algorithms, we will devise an approach which can deliver high qualified 3D shape from the internet and out-door images, without any pre-necessary knowledge.}, subject = {Artificial Intelligence; Computer vision; 3D Reconstruction; Neural networks; Photometric stereo; K{\"u}nstliche Intelligenz; Computer-Vision; 3D-Rekonstruktion; Neuronale Netze; Photometrisches Stereo; Dreidimensionale Rekonstruktion; Maschinelles Sehen; Neuronales Netz}, language = {en} } @incollection{SongRaveFettweisetal., author = {Song, Xiaohang and Rave, Wolfgang and Fettweis, Gerhard and H{\"a}lsig, Tim and Lankl, Berthold and Cvetkovski, Darko and Grass, Eckhard}, title = {MaximumMIMO : millimeter wave line-of-sight spatial multiplexing}, series = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, booktitle = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, doi = {10.26127/BTUOpen-5911}, publisher = {BTU Cottbus - Senftenberg}, pages = {139 -- 166}, abstract = {In 2012 a group of researchers proposed a basic research initiative to the German Research Foundation (DFG) as a special priority project (SPP) with the name: Wireless 100 Gbps and beyond. The main goal of this initiative was the investigation of architectures, technologies and methods to go well beyond the state of the art. The target of 100 Gbps was set far away from the (at that time) achievable 1 Gbps such that it was not possible to achieve promising results just by tuning some parameters. We wanted to find breakthrough solutions. When we started the work on the proposal we discussed the challenges to be addressed in order to advancing the wireless communication speed significantly. Having the fundamental Shannon boundary in mind we discussed how to achieve the 100 Gbps speed.}, subject = {Wireless; 100 Gbps; Drahtlos; Millimeter wave; Line-of-sight spatial multiplexing; MaximumMIMO; Millimeter-Welle; LOS-Raum-Multiplexing; Drahtloses Sensorsystem; Hochfrequenztechnik; Antenne; Terahertzbereich; Energieffizienz}, language = {en} } @phdthesis{Krishnegowda2020, author = {Krishnegowda, Karthik}, title = {Investigation of PSSS technologies to achieve 100 Gbps and beyond}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-52055}, school = {BTU Cottbus - Senftenberg}, year = {2020}, abstract = {The requirement for wireless communication with a speed beyond 100 Gbps is growing. There are mainly two possible approaches to achieve 100 Gbps system. One approach is to target lower transmission bandwidth and very high spectral efficiency. This method requires advanced digital signal processing operations, which are power-hungry. Another possible path is to go for a high-transmission bandwidth and a moderate spectral efficiency. We decided for this direction to implement a 100 Gbps system. We have chosen parallel sequence spread spectrum (PSSS) as an analog-friendly mixed-signal modulation where most of the baseband processing is in the analog domain, and only a small part is in the digital domain. For the channel equalization, we consider an "effective channel" that takes into account the wireless channel and the effects of the transmitter and receiver hardware impairments. The influence of the nonlinear channel response was analyzed for a PSSS modulated signal by employing the RAPP model for the power amplifier. For the first time, we performed a Hardware-In-The-loop experiment using PSSS modulation in the terahertz band. A PSSS modulated signal at a chip rate of 20 Gcps with spectral efficiency of 4 bit/s/Hz is transmitted using a 230 GHz RF-frontend operating in the linear range to achieve a data rate of 80 Gbps. One more important property is that the channel estimation and equalization are performed in the analog domain. A high-speed channel equalization algorithm was developed and implemented on FPGA/ASIC, which operates at(1/10)th of PSSS symbol rate. A parallel PSSS encoder transmitter architecture was designed to work at a high chip rate, and it was implemented on FPGA /ASIC and had an energy efficiency of 0.21 pJ bit-1 on 28nm ASIC. In this Thesis, we put forward a case for the analog-friendly modulation scheme called PSSS. This scheme does not only modulates the signal but rather builds up an eco-system (such as channel estimation, equalization, and synchronization), which is responsible for the baseband operation.}, subject = {Submillimeter-wave; Broadband receiver; PHY layer; Hardware-in-the-loop; Wireless; Drahtlos; Submillimeterwelle; Breitband-Empf{\"a}nger; THz; PSSS; Drahtloses lokales Netz; Breitbandempf{\"a}nger; Hardware-in-the-loop; Terahertzbereich}, language = {en} } @incollection{CarlowitzVossiekGirgetal., author = {Carlowitz, Christian and Vossiek, Martin and Girg, T. and Dietz, M. and Schrotz, A.-M. and Maiwald, T. and Hagelauer, A. and Weigel, R. and Ghaleb, Hatem and Carta, Corrado and Ellinger, Frank and Du, Xuan-Quang and Gr{\"o}zing, Markus and Berroth, Manfred}, title = {SPARS : simultaneous phase and amplitude regenerative sampling}, series = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, booktitle = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, doi = {10.26127/BTUOpen-5908}, publisher = {BTU Cottbus - Senftenberg}, pages = {37 -- 74}, abstract = {In 2012 a group of researchers proposed a basic research initiative to the German Research Foundation (DFG) as a special priority project (SPP) with the name: Wireless 100 Gbps and beyond. The main goal of this initiative was the investigation of architectures, technologies and methods to go well beyond the state of the art. The target of 100 Gbps was set far away from the (at that time) achievable 1 Gbps such that it was not possible to achieve promising results just by tuning some parameters. We wanted to find breakthrough solutions. When we started the work on the proposal we discussed the challenges to be addressed in order to advancing the wireless communication speed significantly. Having the fundamental Shannon boundary in mind we discussed how to achieve the 100 Gbps speed.}, subject = {100 Gbps; Wireless; Drahtlos; Simultaneous phase sampling; Amplitude regenerative sampling; Amplituden-regenerativ-Sampling; Simultanes Phasen-Sampling; Drahtloses Sensorsystem; Hochfrequenztechnik; Antenne; Terahertzbereich; Energieffizienz}, language = {en} } @phdthesis{SharifiBoroujerdi2018, author = {Sharifi Boroujerdi, Ali}, title = {Linguistic interpretation of visual contents via Deep Learning}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-47184}, school = {BTU Cottbus - Senftenberg}, year = {2018}, abstract = {The main part of the research outlined in this thesis is to develop Deep Learning models for the linguistic interpretation of the visual contents. This part is split into two research problems: interactive region segmentation and captioning, and selective texture labeling. In the first attempt, we proposed a novel hybrid Deep Learning architecture whereby the user is able to specify an arbitrary region of the image that should be highlighted and described. The proposed model alternates the bounding box indications of the standard object localization process with the output of a deep interactive segmentation module to achieve a better understanding of the dense image captioning and improve the object localization accuracy. The idea of the next part is to establish a bidirectional correlation between deep texture representation and its linguistic description via a hybrid CNN-RNN model that enables end-to-end learning of the selective texture labeling. This novel architecture provides new opportunities to describe, search, and also retrieve texture images from their linguistic descriptions. To be able to train such a model, we generated a multi-label texture dataset that covers color, material, and pattern labeling simultaneously. Our contribution to the automatic generation of texture descriptions provides an excellent opportunity to enrich the existing vocabulary of the image captioning. Such a conceptual extension can be used for fine-grained captioning applicable in geology, meteorology and other natural sciences where fine-grained image structures are of importance to understand complicated patterns. Apart from Deep Learning technologies, in the final section of the thesis, we proposed a novel approach to define mathematical morphology on color images. To this end, we converted common RGB-values of the color images into a new biconal color space and then combined two approaches of mathematical morphology to give meaning to the maximum and the minimum of the matrix field data and formulate our novel strategy.}, subject = {Deep Learning; Computer vision; Linguistic Interpretation; Machine Learning; Texture description; Deep Learning; Computer Vision; Linguistische Interpretation; Maschinelles Lernen; Textur Beschreibung; Maschinelles Sehen; Computerlinguistik; Deep Learning}, language = {en} } @misc{OPUS4-4295, title = {Amtliches Mitteilungsblatt der BTU Cottbus-Senftenberg, 2017,17 (21.09.2017)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-42953}, year = {2017}, abstract = {Neufassung der fachspezifischen Pr{\"u}fungs- und Studienordnung f{\"u}r den Bachelor-Studiengang Landnutzung und Wasserbewirtschaftung vom 18. September 2017 (Die Pr{\"u}fungs- und Studienordnung vom 07. Oktober 2011 (Abl. 13/2011) tritt nach Ablauf von vier Semestern nach der festgesetzten Regelstudienzeit und der letztmaligen Immatrikulation außer Kraft.)}, language = {de} } @misc{OPUS4-4296, title = {Amtliches Mitteilungsblatt der BTU Cottbus-Senftenberg, 2017,18 (21.09.2017)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-42966}, year = {2017}, abstract = {Dritte {\"A}nderungssatzung zur fachspezifischen Pr{\"u}fungs- und Studienordnung f{\"u}r den Bachelor-Studiengang Environmental and Resource Management vom 18. September 2017 Neubekanntmachung: Fachspezifische Pr{\"u}fungs- und Studienordnung f{\"u}r den Bachelor-Studiengang Environmental and Resource Management vom 18. September 2017 (Die Studien-und Pr{\"u}fungsordnung vom 07. Oktober 2011, einschließlich der {\"A}nderungssatzungen vom 12. August 2011 (Abl. 14/2011) und vom 18. August 2015 (AMbl. 04/2015) treten außer Kraft.)}, language = {de} } @phdthesis{Sanftl2020, author = {Sanftl, Benedikt}, title = {Kommunikationssystem f{\"u}r induktiv gekoppelte Leistungs{\"u}bertragungssysteme}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-52180}, school = {BTU Cottbus - Senftenberg}, year = {2020}, abstract = {Im Zuge der voranschreitenden drahtlosen Vernetzung von Systemen wie auch von Systemkomponenten im Bereich der Consumer-Elektronik als auch der Industrie wird die Leistungsversorgung von beweglichen Komponenten immer wichtiger. Die meisten dieser Komponenten sind batteriebetrieben und mit ihrer steigenden Anzahl erh{\"o}ht sich auch die Nachfrage nach Konzepten f{\"u}r ihre kontaktlose Versorgung mit Energie. Dabei hat sich vor allem die induktive Leistungs{\"u}bertragung (engl. inductive power transfer (IPT)) als leistungsstarke und weitverbreitete Technologie etabliert. Durch die magnetische Kopplung zweier in geringem Abstand angeordneter Spulen wird kontaktlos, aber h{\"o}chst effizient Leistung {\"u}bertragen. Zus{\"a}tzlich zur Leistung sollen aber auch Informationen bzw. Steuerungsbefehle zwischen der station{\"a}ren Ladestation und den mobilen Verbrauchern ausgetauscht werden. L{\"a}sst sich {\"u}ber die magnetisch gekoppelten Spulen bereits eine Wechselstromleistung in Form von HF-Signalen {\"u}bertragen, muss dies auch f{\"u}r modulierte HF-Signale zur Informations{\"u}bertragung m{\"o}glich sein. Diese Arbeit stellt ein Konzept vor, das ein Leistungs{\"u}bertragungssystem mit induktiv gekoppeltem Spulenpaar um ein Kommunikationsmodul zur bidirektionalen, robusten {\"U}bertragung von digitalen Informationen erweitert. Zun{\"a}chst werden in dieser Arbeit die Rahmenbedingungen der IPT und die Anforderungen an die Nachrichten{\"u}bertragung f{\"u}r ein kombiniertes Daten- und Leistungs{\"u}bertragungssystem vorgestellt. Hierzu wird unter Nutzung ein und derselben Koppelspulen ein durch Frequenzmultiplexverfahren vom Leistungskanal getrennter {\"U}bertragungskanal realisiert. {\"U}ber diesen Kanal l{\"a}sst sich die induktive Daten{\"u}bertragung realisieren. Ein weiterer Teil der Untersuchungen stellt dar, wie einzelne Nachrichtenpakete optimal an die Kanalverh{\"a}ltnisse angepasst und damit unter verbesserten Bedingungen {\"u}bertragen werden k{\"o}nnen. Dabei kommen moderne Modulationsverfahren zum Einsatz, deren Grundlagen ebenfalls in dieser Arbeit erl{\"a}utert werden. Ab- schließend wird die Technologie mit Hilfe eines Prototypen demonstriert und daran messtechnisch die Performanz des Systems belegt. Abgerundet wird die Arbeit mit einer Diskussion der Messergebnisse und einem Vergleich mit dem aktuellen Stand der Technik. Hierdurch kann die Frage beantwortet werden, ob die Technologie unter industriellen Betriebsbedingungen einsetzbar ist.}, subject = {Induktive Leistungs{\"u}bertragung; Kommunikation; Systemdesign; Inductive power transfer; Communication; System design; Drahtlose Energie{\"u}bertragung; Kommunikationstechnik; Frequenzmultiplex; Prototyp}, language = {de} } @book{OPUS4-4537, title = {Wir forschen, lehren und lernen aus Leidenschaft f{\"u}r eine bessere Welt von morgen}, editor = {Steinbach, J{\"o}rg}, publisher = {Brandenburgische Technische Universit{\"a}t Cottbus - Senftenberg}, address = {Cottbus}, organization = {Brandenburgische Technische Universit{\"a}t Cottbus-Senftenberg}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-45375}, publisher = {BTU Cottbus - Senftenberg}, year = {2018}, abstract = {Unsere Universit{\"a}t tr{\"a}gt mit dazu bei, eine Welt zu schaffen, die auf eine nachhaltige Zukunft ausgerichtet ist. Mit interdisziplin{\"a}rer Forschung, innovativer Lehre, Wissens-, Technologietransfer und Weiterbildung suchen wir nach L{\"o}sungsans{\"a}tzen f{\"u}r die Herausforderungen im Bereich Energie, Informationstechnologien, Umwelt, Gesundheit und Kultur. Dabei arbeiten wir auf internationaler, nationaler wie auch auf regionaler Ebene mit anderen Wissenschafts- und Forschungseinrichtungen sowie mit Akteuren aus Politik, Wirtschaft und Kultur eng zusammen. Unsere noch junge Geschichte verstehen wir als Chance f{\"u}r die Weiterentwicklung einer modernen Technischen Universit{\"a}t, die sich verantwortungsbewusst den Anforderungen unserer Zeit stellt. Mit interdisziplin{\"a}ren Verfahrensweisen und Gemeinschaftssinn gehen wir neue Wege in all unseren Bereichen. Kreativit{\"a}t und Weltoffenheit sind dabei unsere Markenzeichen. Unsere St{\"a}rke liegt im intensiven Dialog: zwischen Studierenden und Lehrenden, zwischen Fakult{\"a}ten und Verwaltung, zwischen Hochschulleitung und Fachgebieten. Unsere Gr{\"o}ße erlaubt uns ein Miteinander, um das uns andere Universit{\"a}ten beneiden. Wir leben Leistungsbereitschaft mit Gemeinsinn, Streben nach Erfolg mit einer respektvollen Diskussionskultur sowie eigenverantwortliches Handeln mit einer wertsch{\"a}tzenden Arbeitskultur gleichermaßen. Familie und alle Lebensformen von Vielfalt sch{\"a}tzen wir. Die enge Verzahnung innerhalb unserer Universit{\"a}t, unsere internationale Vernetzung und die kooperative Zusammenarbeit pr{\"a}gen eine Kultur, die eine ideale Voraussetzung f{\"u}r erfolgreiches Forschen und Studieren ist. Der gemeinschaftliche Charakter unserer Universit{\"a}t unterscheidet uns von vielen anderen Hochschulen.}, subject = {Forschung; Wissens- und Technologietransfer; Lehre; Internationalit{\"a}t; Innovation; Innovation Research; Knowledge and technology transfer; Teaching; Internationality; Innovation; Brandenburgische Technische Universit{\"a}t Cottbus-Senftenberg; Cottbus; Forschung; Wissens- und Technologietransfer; Hochschule; Lehre; Internationalit{\"a}t; Innovation}, language = {de} } @phdthesis{CastilloAlejandre2019, author = {Castillo Alejandre, Susana}, title = {Digital humanity: the temporal and semantic structure of dynamic conversational facial expressions}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-51562}, school = {BTU Cottbus - Senftenberg}, year = {2019}, abstract = {This thesis focuses on establishing a - theoretically founded and empirically derived - novel methodological pipeline to provide Embodied Conversational Agents (ECAs) with natural facial expressions and desired personality traits. After giving an overview on the content of this thesis, we dedicate its second part to derive the Semantic Space (SSp) for facial expressions, finding that the same space is used for expression words, expression videos, and motion-capture-based point-cloud animations. The process involved the creation of a new facial expression database using Motion Capture (MoCap) technology. Our technique can be used to empirically map specific motion trajectories (including their frequency-decomposition) onto specific perceptual attributes, allowing the targeted creation of novel animations with the desired perceptual traits, as exemplified in the third part of this thesis. Before addressing our final conclusions and, on the grounds that the systematic differences between individuals while performing the same facial expressions are related to their personality, we devote the fourth part of this thesis to the study of the mapping between personality and expressive facial motions.}, subject = {Facial Animation; Cognitive-based behavioural modelling; Motion capture; Personality; Gesichtsanimation; Kognitiv-basierte Verhaltensmodellierung; Pers{\"o}nlichkeit; Merkmalsextraktion; Motion Capturing; Mimik; Computeranimation}, language = {en} } @phdthesis{Boehm2022, author = {B{\"o}hm, Sebastian}, title = {Split-Protocol-Stack network simulation and emulation of wireless embedded systems with Radio-in-the-Loop : towards accurate wireless network evaluation}, doi = {10.26127/BTUOpen-6144}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-61443}, school = {BTU Cottbus - Senftenberg}, year = {2022}, abstract = {Recent challenges and novel approaches of wireless communication networks are characterized by high performance requirements on the radio channel and by concepts of self-organization, in-network processing, or resource optimization which ultimately lead to distributed network applications, communication architectures, and radio transceivers. Associated evaluation is driven by a multitude of ever-increasing requirements that call for multidisciplinary expertise. Depending on the discipline, simulation is one of the most widely used technologies, whereby often abstract assumptions and models do not allow for sufficiently accurate, comparable results. In contrast, real-world measurements and field-tests can only be performed on actual systems, commonly under non-reproducible conditions. This thesis establishes with the Split-Protocol-Stack a new type of evaluation method that intends to help closing the gap between purely simulative analyzes and real-world tests. With the inclusion of real radio hardware and radio channels in the event-based simulation, this central hybrid approach in connection with the Radio-in-the-Loop methodology creates synergies in interdisciplinary fields. The approach contains analytical discussions, methodological strategies, and practical contributions that are summarized as key elements in the subsequent central considerations and challenges. With Real-Time-Shift, a pseudo-real-time synchronization approach for parallel simulation and radio channel emulation of communication flows is introduced. Based on the underlying time compensation scheme, the discrete event simulation is decoupled from real-time constraints when exchanging event messages with real-world wireless hardware. A physical layer emulation methodology and radio channel interface concept, called Radio-in-the-Loop, is introduced along with two practical realization approaches. Furthermore, strategic details on radio network planning with an approach to automatic hardware resource allocation are presented for radio channel emulation-capable network testbeds. The contributions of this work are evaluated using real-world reference measurements, practical application scenarios, and experiments that provide proof of concepts. By means of an exemplary selected cross-layer optimization scenario, the benefits are practically demonstrated and discussed. Finally, based on IEEE 802.15.4 as the reference protocol standard for low-power wireless networks, this thesis provides feasibility studies and analysis results using the representative prototype SEmulate for the Split-Protocol-Stack approach.}, subject = {Internet of things; Network simulation; Hardware-in-the-Loop; Modeling; IEEE 802.15.4; Internet der Dinge; Netzwerksimulation; Emulation; Modellierung; Emulation; Internet der Dinge; Netzwerksimulation; Hardware-in-the-loop; IEEE 802., 15, 4}, language = {en} } @phdthesis{Assaf2021, author = {Assaf, George}, title = {Fuzzy coloured Petri nets for modelling biological systems with uncertain kinetic parameters}, doi = {10.26127/BTUOpen-5851}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-58516}, school = {BTU Cottbus - Senftenberg}, year = {2021}, abstract = {Over the last twenty years, Petri nets have been increasingly adopted for modelling and simulating biological systems, as they offer an intuitive and graphical approach for this purpose. Their usability convenience comes from the fact that they offer many types of elements to describe systems in a qualitative and quantitative way. Coloured Petri nets are particularly useful to model systems with repeated components in a compact fashion. Our tool Snoopy for modelling and simulating Petri nets is one of the most well-known tools supporting a family of related Petri net classes comprising stochastic, continuous and hybrid Petri nets, and covering uncoloured and coloured Petri nets alike. However, kinetic information of a biological system, i.e. kinetic parameters may be uncertain, due to many reasons, e.g. environmental factors. Besides, coloured Petri nets as they were previously supported in Snoopy suffered from some inconsistencies. Due to these inconsistencies, exploring the model behaviour using different sizes (scaleability) was not feasible. Both challenges call for a new and more powerful approach integrating the modelling of uncertainties together with modelling features supporting repeated structures in a compact and scalable way. This thesis comprises two major contributions: Firstly, we introduce the definition and present the simulation algorithm for both uncoloured and coloured fuzzy Petri nets, by extending the existing quantitative uncoloured and coloured Petri nets in Snoopy. This includes discretising the uncertain kinetic parameters to crisp values by using sampling strategies. Secondly, we harmonise coloured Petri nets in Snoopy with their uncoloured counterparts and we extend the Snoopy's coloured Petri nets by all the features, which are supported by the coloured abstract net description language - an exchange format of coloured Petri nets in our PetriNuts tool family. By performing fuzzy simulation, one can obtain two kinds of output: fuzzy bands of each output variable and their corresponding timed-membership functions. Each fuzzy band describes the uncertainties associated with the input, whereas membership functions give more accurate information about the associated uncertainties. The most important features that we obtain by harmonising coloured Petri nets are to develop scaleable models, by defining scaling factors as constants and unifying the usage of coloured Petri nets with the other tools in our PetriNuts tool family.}, subject = {Uncertain biological systems; Petri nets; Fuzzy logic; Colouring fuzziness; Software harmonisation; Unbestimmte Systembiologie; Modellierung; Petri-Netze; Software Hamonisierung; Simulation; Gef{\"a}rbtes Petri-Netz; Systembiologie; Fuzzy-Logik}, language = {en} } @masterthesis{Bergmann2021, type = {Bachelor Thesis}, author = {Bergmann, Max}, title = {A machine learning approach for churn prediction within the social network Jodel}, doi = {10.26127/BTUOpen-6087}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-60878}, school = {BTU Cottbus - Senftenberg}, year = {2021}, abstract = {Within the last decades, the number of social networks is growing fast. The competition of retaining the customers to grow their platform and increase their profitability is rising. That is why companies need to detect possible churners to retain these. The problem of predicting the users' lifetime, churning users, and the reasons for churning can be tackled by using machine learning. The goal of this bachelor thesis is to build machine learning models to predict user churn and the user lifetime within the social network Jodel, a location-based anonymous messaging application for Android and iOS. To get the best possible prediction results, we have started with extensive literature research, whose approaches we have tested and added to a machine learning pipeline to build predictive models. With these models, we have investigated the performance after different observation time windows and have finally compared the strongest models to detect similarities and understand the insights to learn their behaviour. The results of this thesis are machine learning models for a selected representative set of communities varying in size within the Kingdom of Saudi Arabia and a country model leveraging all data. These models are used for a regression task by predicting the lifetime of a user and a multi-label classification of a user into six different churn classes. Additionally, we have also given models for a binary classification, where the model will predict if the user will churn within a given time or not. These models have shown general strong predictive power, which is shrinking when limiting the observation time window. Especially the binary classification yielded high accuracy of over 99\%. The best models have been used for predicting user churn within other communities to detect communities with possible similar behaviour. These similarities then have been determined by features' importance, where the most important features have got fed back into empirics. This has shown statistically significant differences between user groups with a different active time but as of today no clear trends were visible that had led us to define the communities' behaviours. Since the competition of social networks is still growing, the retaining of users will stay a core marketing strategy, which will need to be tackled by machine learning and artificial intelligence. The created models could be useful for predicting churning users within the platform Jodel to detect these customers that will churn within a given time. Researches did not focus much on anonymous and location-based messaging. That is why the results of this thesis on the anonymous messaging application Jodel opens a variety of possible tasks for the future in this context.}, subject = {Machine learning; Churn prediction; Neural networks; Python; Feature engineering; Maschinelles Lernen; Online-Community; Prognose; Maschinelles Lernen; Abwanderungsvorhersage; Neuronale Netze; Klassifizierungsb{\"a}ume; Regressionsb{\"a}ume}, language = {en} } @misc{OPUS4-5947, title = {Amtliches Mitteilungsblatt der BTU Cottbus-Senftenberg, 2022,8 (22.06.2022)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-59473}, year = {2022}, abstract = {Habilitationsordnung der Fakult{\"a}t 3 - Maschinenbau, Elektro- und Energiesysteme vom 15. Juni 2022}, language = {de} } @misc{OPUS4-5948, title = {Amtliches Mitteilungsblatt der BTU Cottbus-Senftenberg, 2022,9 (22.06.2022)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-59481}, year = {2022}, abstract = {Richtlinie zur Erhebung und Verwendung von Gemeinkosten an der Brandenburgischen Technischen Universit{\"a}t Cottbus-Senftenberg (BTU)}, language = {de} } @misc{OPUS4-5870, title = {Amtliches Mitteilungsblatt der BTU Cottbus-Senftenberg, 2022,6 (30.03.2022)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-58705}, year = {2022}, abstract = {Erste {\"A}nderungssatzung zur fachspezifischen Pr{\"u}fungs- und Studienordnung f{\"u}r den Master-Studiengang Wirtschaftsrecht f{\"u}r Technologieunternehmen vom 29. M{\"a}rz 2022 (erg{\"a}nzt AMbl. 14/2020)}, language = {de} } @phdthesis{Filetti2017, author = {Filetti, Mirko}, title = {Open Source basierte Virtuelle Forschungsumgebungen f{\"u}r Projekte in der {\"o}kologischen Langzeitforschung : das „Rapid L-TER VRE" Baukastenkonzept zur schnellen und nachhaltigen Realisierung}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-48405}, school = {BTU Cottbus - Senftenberg}, year = {2017}, abstract = {Virtuelle Forschungsumgebungen (VRE), sind Plattformen auf Basis von Informations- und Kommunikationstechnologien (engl. ICT) mit ganzheitlichem Ansatz, die das wissenschaftliche Arbeiten im Team und insbesondere dessen Kommunikation und Organisation unterst{\"u}tzen sollen. Sie haben zum Ziel, schneller und besser zu nachvollziehbaren Ergebnissen zu gelangen, als bisher. Projekte in der {\"o}kologischen Langzeitforschung (engl. long-term ecological research, im Folgenden als L-TER bezeichnet) sind durch den Langzeitaspekt und Raumbezug in der Regel umfangreiche Projekte mit mittleren und großen Datenmengen (Medium Data und Big Data) sowie interdisziplin{\"a}ren, {\"o}rtlich verteilten Forschungsgruppen. Sie sind daher pr{\"a}destiniert f{\"u}r den Einsatz von VREs. Die vorliegende Arbeit untersucht die spezifischen Aspekte und Anforderungen an virtuelle Forschungsumgebungen von L-TER Projekten im Kontext der Umweltinformatik. Dazu wird der Begriff „L-TER VRE" eingef{\"u}hrt. Grundlage hierf{\"u}r ist der Stand des Wissens zu allgemeinen VREs, Datenmanagement und ICT, die interdisziplin{\"a}r in Verbindung gebracht werden mit den Zielen, Methoden und Daten der L-TER (z.B. Analyse von Zeitreihen). Es zeigt sich, dass sich die Anforderungen an L-TER VREs - aufgrund ihres Einsatzbereiches f{\"u}r langfristige L-TER Projekte - in der Nachhaltigkeit durch ihre Persistenz (Daten, Infrastruktur), Flexibilit{\"a}t (projektspezifische Rahmenbedingungen), der eingesetzten ICT und vom Faktor „Mensch" mit seinem gesellschaftlichen Umfeld von VREs f{\"u}r andere Aufgaben unterscheiden. Aus den Erkenntnissen wird ein innovatives Baukastenkonzept mit dem Namen „Rapid L-TER VRE" zur Planung, dem Aufbau und Betrieb von L-TER VREs vorgestellt. Es basiert auf Open-Source-Software und kann durch die gemeinsame Basis der Bausteine auch f{\"u}r allgemeine VREs Verwendung finden. Da VREs oder {\"a}hnliche ICT-Infrastrukturen im Rahmen von „e-Science" als R{\"u}ckgrat f{\"u}r die Organisation der Projekte pr{\"a}destiniert sind, ist der Aufbau solcher Infrastrukturen oft schon zur Voraussetzung bei der Antragstellung von Projekten geworden. Ein Prototyp sollte daher bereits vor oder bei der Antragstellung existieren. Sp{\"a}testens zum Projektbeginn muss eine Produktivumgebung zur Verf{\"u}gung stehen. Vor diesem Hintergrund ist das Konzept „Rapid L-TER VRE" speziell f{\"u}r eine schnelle (engl. rapid) Entwicklung von VRE Prototypen mit einer kurzen {\"U}bergangsphase in den Produktivbetrieb ausgelegt. Das Baukastenkonzept wird auf verschiedene existierende Projekte im Umfeld des Fachgebietes „Environmental Informatics" und der Fakult{\"a}t „Umwelt und Naturwissenschaften" der BTU Cottbus-Senftenberg konzeptionell, sowie in der Form von Prototypen angewendet und dessen Anwendbarkeit allgemein bewertet. Aus den Erkenntnissen werden allgemeine Schlussfolgerungen in Bezug auf den Einsatz von Technologien und die Nachhaltigkeit f{\"u}r den erfolgreichen Betrieb von L-TER VREs gezogen - dabei steht der Mensch als „maßgeblicher" Faktor im Mittelpunkt.}, subject = {Virtuelle Forschungsumgebung; {\"O}kologische Langzeitforschung; Umweltinformatik; E-Science; Open-Source; Virtual research environment; Long-term ecological research; Environmental informatics; E-Science; Open-Source; Umweltinformatik; Virtuelle Forschungsumgebung}, language = {de} } @phdthesis{Liu2021, author = {Liu, Ke}, title = {Parallel constraint solving for combinatorial problems}, doi = {10.26127/BTUOpen-5437}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-54375}, school = {BTU Cottbus - Senftenberg}, year = {2021}, abstract = {With parallelism becoming the standard in computer design, research on parallel constraint solving technique is of vital importance for enhancing the performance of constraint solving. In this dissertation, we reviewed the literature on exploiting parallelism in constraint solving to help gain insight into the rationale of different types of parallel constraint solving approaches. On this basis, we analyzed the effectiveness of parallel constraint solving, with the focus on obtaining a first solution when solving computationally hard combinatorial problems. We have shown that a well-designed search space splitting method and constraint programming model can enable the embarrassingly parallel search (EPS) to solve some open instances of the social golfer problem that have not been solved by a sequential algorithm. We also observed superlinear speedups when solving these instances, which confirms our theoretical analysis. Besides, we examined two practical constraint optimization problems, including the traveling tournament problem with predefined venues and the talent scheduling problem. Our proposed constraint models outperformed the existing models on the same instances, and the EPS approach could always attain better feasible solutions in terms of the optimal objective value by using more parallel processors. To explore the use of massively parallel processing, we proposed the parallel stochastic portfolio search, which is a simple and non-intrusive way to parallelize different incarnations of a sequential solver. When comparing the existing portfolio to our portfolio approach by solving the same constraint satisfaction problems using the same constraint models, our technique could solve harder and larger instances. The successes of our new parallel approaches are attributed to early diversity; i.e., some diversity early in the search introduced by parallelism can offset early mistakes caused by weak heuristic choices. Unlike the other techniques (e.g., limited discrepancy search) used to overcome early mistakes, the studied two parallel constraint solving approaches not only can explore more nodes simultaneously but also does not sacrifice the guarantee of completeness. We also presented a hypertree decomposition method that builds a degenerate decomposition tree for a given constraint network, in which each node of the decomposition tree possesses and executes a subset of constraints of the given constraint network. The usefulness of our proposed parallel techniquedepends on whether we can find an efficient way to join the results of each node.}, subject = {Parallel constraint solving; Parallel computing; Constraint programing; Constraint-Programmierung; L{\"o}sen von Zwangsbedingungen; Paralleles Rechnen; SGP; Constraint-Programmierung; Parallelverarbeitung}, language = {en} } @phdthesis{Hasani2021, author = {Hasani, Alireza}, title = {High-throughput QC-LDPC codes for next-generation wireless communication systems}, doi = {10.26127/BTUOpen-5819}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-58194}, school = {BTU Cottbus - Senftenberg}, year = {2021}, abstract = {Wireless communication has become an indispensable part of our life and the demand for achieving higher throughput with lower energy consumption is ever growing. The ambitious throughput of 100 Gb/s and beyond is now becoming a modest goal thanks to comprehensive advances in transmission technologies and protocols. One important aspect of these advances is with regard to channel coding methods and the ability to detect and correct errors at the receiver. Computations needed by such methods become generally more complicated as they become more powerful in their performance. This imposes a great challenge for researchers attempting to devise practical methods for encoding and decoding Forward-error Correction (FEC) techniques tailored for high-throughput scenarios. In this work we focus on high-throughput Quasi-Cyclic LDPC (QC-LDPC) codes, as they have been selected as one of the main FEC techniques for the two major next generation wireless technologies, namely Wi-Fi 6 (IEEE 802.11ax) and 5G. Our target is to develop complete encoding and decoding design for these codes in order to reach the throughput of 100 Gb/s with affordable power consumption. Toward this goal, we investigate first the appropriate encoder design for these codes which can be used at such high data-rate with reasonably low power consumption. Then we propose several novel ideas for improving the decoding performance and complexity of QC-LDPC codes. The proposed novel ideas collectively facilitate a decoder able to run at 50 Gb/s with less than 12 pJ/b energy consumption for a Latin squares QC-LDPC code. All the proposed methods are practical and implementable and their effectiveness are showcased by either Field Programmable Gate Array (FPGA) or Application-Specific Integrated Circuit (ASIC) synthesis.}, subject = {LDPC decoding; High-throughput decoding; Belief propagation; LDPC-Decodierung; Decodierung mit hohem Durchsatz; Glaubensverbreitung; Datenfunknetz; Kanalcodierung; Low-Density-Parity-Check-Code; Vorw{\"a}rtsfehlerkorrektur}, language = {en} } @phdthesis{Rietz2017, author = {Rietz, Ren{\´e}}, title = {Optimization of network intrusion detection processes}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-44327}, school = {BTU Cottbus - Senftenberg}, year = {2017}, abstract = {Intrusion detection is a concept from the field of IT security. Network intrusion detection systems (NIDS) are used in addition to preventative measures, such as firewalls, to enable an automated detection of attacks. Network security threats often consist of multiple attack phases directed against various components of the network. During each attack phase, varying types of security-related events can be observed at various points in the network. Security monitoring, however, is nowadays essentially limited to the uplink to the internet. Sometimes it is also used to a limited extent at key points within a network, but the analysis methods do not have the same depth as at the uplink. Other areas, such as virtual networks in virtual machines (VMs), are not covered at all, yet. The aim of this thesis has been to improve the detection capability of attacks in local area networks. With a glance at the area of safety engineering, it appears efficient to secure these networks thoroughly and to develop additional monitoring solutions only for the remaining problem cases. This entails several challenges for the analysis of different parts of the TCP/IP stack. The lowermost part of the network stack has to be analyzed for attacks on network components, such as switches and VM bridges. For this, there is still no technology. Although attacks on the layers~2 and 3, such as ARP spoofing and rogue DHCP servers in physical networks, can be controlled to some extent by appropriate switches, equivalent methods are not used in virtual networks. Therefore, a software-defined networking based approach is proposed to counteract the respective attacks, which works for physical and virtual networks. The upper layers are already largely covered by traditional NIDS methods, but the rapidly increasing data rates of local area networks often lead to an uncontrolled discarding of traffic due to overload situations in the monitoring stations. Therefore, the drawbacks of current optimization approaches are outlined based on a detailed performance profiling of typical intrusion detection systems. A new approach for parallelizing the intrusion detection analysis that copes with the increasing network dynamics is introduced and evaluated. Since further special issues for NIDS particularly go back to the massive use of web technologies in today's networks, a firewall architecture is presented which applies novel NIDS methods based on machine learning to identify web applications and to ward off malicious inputs. The architecture addresses the entire process chain starting from the data transfer with HTTP via the analysis of manipulated web documents to the extraction and analysis of active contents.}, subject = {Intrusion Detection Systems (NIDS); Software-Defined Networking (SDN); Parallel NIDS; Web Firewall (Web 2.0); Machine Learning; Einbrucherkennungssysteme (IDS); Software-definierte Netzwerke (SDN); Web Firewall; Web 2.0; Maschinelles Lernen; Eindringerkennung; Maschinelles Lernen; Software-defined networking; World Wide Web 2.0; Firewall}, language = {en} } @phdthesis{Voertler2017, author = {V{\"o}rtler, Thilo}, title = {Verification of software for Contiki-based low-power embedded systems using software model checking}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-44080}, school = {BTU Cottbus - Senftenberg}, year = {2017}, abstract = {The main building blocks for the internet of things are connected embedded systems. Often these systems are also used in safety critical applications. Therefore, it is particularly important that these devices work according to their specification i.e. they behave as intended. Nowadays, even for simple devices embedded operating systems as Contiki are used to simplify application development and to increase portability between different hardware platforms. The main objective of this thesis is to present a methodology for the verification of software applications written for the operation system Contiki, taking the system hardware into account. Therefore, software model checking and especially bounded model checking [BCC⁺03] is used as a technique, which allows to formally verify software for embedded systems. For verifying the software against its specification, it is also necessary to build a model of the system hardware. Thereby, the difficulty is to create a model which is detailed enough to capture the hardware behavior so that the software performs correctly, while keeping the computation effort for the verification process manageable. In this work, the drivers which communicate with the hardware are therefore replaced with abstract models during the verification process. This enables the verification based on an abstract hardware platform independent of specific hardware. A special role within embedded systems play interrupts. Interrupts are used to save power and can also be used to react on external events. Current methods for verification of interrupt driven software are based on the interleaving model and partial order reduction to reduce the size of the verification problem. This thesis argues that this method is not sufficient for software, whose behavior relies on periodically occurring interrupts. Therefore, in this thesis, a new approach called periodic interrupt modeling is introduced. This approach can be applied automatically and reduces the number of incorrect verification results due to inaccurate modeling. In addition, properties can be proven that depend on the number of occurring interrupts. Using applications for the Contiki operating system, and based on a verification flow, the approaches toward interrupt modeling are compared.}, subject = {Embedded Systems; Interrupts; Model Checking; Contiki; Software; Contiki; Eingebettete Systeme; Unterbrechungen; Modellpr{\"u}fung; Software; Eingebettetes System; Interrupt ; Bounded Model Checking; Software}, language = {en} } @incollection{AscheidWangBirkeetal., author = {Ascheid, Gerd and Wang, Gaojian and Birke, Sebastian and Wehn, Norbert and Herrmann, Matthias and Wang, Yanlu and Hanay, Oner and Bayram, Erkan and Negra, Renato}, title = {LP100 : optimization of 100 Gb/s short range wireless transceivers under processing energy constraints}, series = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, booktitle = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, doi = {10.26127/BTUOpen-5906}, publisher = {BTU Cottbus - Senftenberg}, pages = {1 -- 35}, abstract = {In 2012 a group of researchers proposed a basic research initiative to the German Research Foundation (DFG) as a special priority project (SPP) with the name: Wireless 100 Gbps and beyond. The main goal of this initiative was the investigation of architectures, technologies and methods to go well beyond the state of the art. The target of 100 Gbps was set far away from the (at that time) achievable 1 Gbps such that it was not possible to achieve promising results just by tuning some parameters. We wanted to find breakthrough solutions. When we started the work on the proposal we discussed the challenges to be addressed in order to advancing the wireless communication speed significantly. Having the fundamental Shannon boundary in mind we discussed how to achieve the 100 Gbps speed.}, subject = {100 Gbps; Wireless; Drahtlos; Short range wireless transceiver; Kurzreichweiten-Funk-Transceiver; Drahtloses Sensorsystem; Hochfrequenztechnik; Antenne; Terahertzbereich; Energieffizienz}, language = {en} } @incollection{SteegTebartDuelmeetal., author = {Steeg, Matthias and Tebart, Jonas and D{\"u}lme, Sebastian and St{\"o}hr, Andreas and Exner, Florian and Czylwik, Andreas and Alissa, Mai and Kaiser, Thomas}, title = {Tera50+ : sub-mm-wave 100 Gbit/s fiber-wireless transmission system}, series = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, booktitle = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, doi = {10.26127/BTUOpen-5909}, publisher = {BTU Cottbus - Senftenberg}, pages = {75 -- 108}, abstract = {In 2012 a group of researchers proposed a basic research initiative to the German Research Foundation (DFG) as a special priority project (SPP) with the name: Wireless 100 Gbps and beyond. The main goal of this initiative was the investigation of architectures, technologies and methods to go well beyond the state of the art. The target of 100 Gbps was set far away from the (at that time) achievable 1 Gbps such that it was not possible to achieve promising results just by tuning some parameters. We wanted to find breakthrough solutions. When we started the work on the proposal we discussed the challenges to be addressed in order to advancing the wireless communication speed significantly. Having the fundamental Shannon boundary in mind we discussed how to achieve the 100 Gbps speed.}, subject = {100 Gbps; Wireless; Drahtlos; Tera50+; Fiber-wireless transmission system; Glasfaser-Funk-{\"U}bertragungssystem; Drahtloses Sensorsystem; Hochfrequenztechnik; Antenne; Terahertzbereich; Energieffizienz}, language = {en} } @incollection{DeutschmannGieseJacobetal., author = {Deutschmann, Bj{\"o}rn and Giese, Malte and Jacob, Arne F. and Lofti, Nima and Gerfers, Friedel and Vehring, S{\"o}nke and B{\"o}ck, Georg}, title = {PolyData/DataRace : polymer-integrated CMOS-based high-speed communication systems at W-band}, series = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, booktitle = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, doi = {10.26127/BTUOpen-5917}, publisher = {BTU Cottbus - Senftenberg}, pages = {397 -- 444}, abstract = {In 2012 a group of researchers proposed a basic research initiative to the German Research Foundation (DFG) as a special priority project (SPP) with the name: Wireless 100 Gbps and beyond. The main goal of this initiative was the investigation of architectures, technologies and methods to go well beyond the state of the art. The target of 100 Gbps was set far away from the (at that time) achievable 1 Gbps such that it was not possible to achieve promising results just by tuning some parameters. We wanted to find breakthrough solutions. When we started the work on the proposal we discussed the challenges to be addressed in order to advancing the wireless communication speed significantly. Having the fundamental Shannon boundary in mind we discussed how to achieve the 100 Gbps speed.}, subject = {100 Gbps; Wireless; Drahtlos; PolyData; DataRace; W-band; W-Band; Drahtloses Sensorsystem; Hochfrequenztechnik; Antenne; Terahertzbereich; Energieffizienz}, language = {en} } @incollection{BhutaniBoesGoetteletal., author = {Bhutani, A. and Boes, F. and Goettel, B. and Schaefer, J. and Eisenbeis, J. and Zwick, T. and Malz, Stefan and Rodriguez Vazquez, Pedro and Grzyb, Janusz and Pfeiffer, Ulrich}, title = {Real100G.RF : a fully integrated, multi-purpose radio front-end for wireless 100 Gbps}, series = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, booktitle = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, doi = {10.26127/BTUOpen-5915}, publisher = {BTU Cottbus - Senftenberg}, pages = {295 -- 354}, abstract = {In 2012 a group of researchers proposed a basic research initiative to the German Research Foundation (DFG) as a special priority project (SPP) with the name: Wireless 100 Gbps and beyond. The main goal of this initiative was the investigation of architectures, technologies and methods to go well beyond the state of the art. The target of 100 Gbps was set far away from the (at that time) achievable 1 Gbps such that it was not possible to achieve promising results just by tuning some parameters. We wanted to find breakthrough solutions. When we started the work on the proposal we discussed the challenges to be addressed in order to advancing the wireless communication speed significantly. Having the fundamental Shannon boundary in mind we discussed how to achieve the 100 Gbps speed.}, subject = {100 Gbps; Wireless; Drahtlos; Real100G.RF; Fully integrated; Multi-purpose radio front-end; Vollst{\"a}ndig integriert; Vielseitig anwendbare Funkeingangsstufe; Drahtloses Sensorsystem; Hochfrequenztechnik; Antenne; Terahertzbereich; Energieffizienz}, language = {en} } @incollection{BuechnerNolteHasanietal., author = {B{\"u}chner, Steffen and Nolte, J{\"o}rg and Hasani, Alireza and Kraemer, Rolf and Lopacinsiki, Lukasz}, title = {End2End100 : communication protocol processing for ultra high data rates}, series = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, booktitle = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, doi = {10.26127/BTUOpen-5916}, publisher = {BTU Cottbus - Senftenberg}, pages = {359 -- 396}, abstract = {In 2012 a group of researchers proposed a basic research initiative to the German Research Foundation (DFG) as a special priority project (SPP) with the name: Wireless 100 Gbps and beyond. The main goal of this initiative was the investigation of architectures, technologies and methods to go well beyond the state of the art. The target of 100 Gbps was set far away from the (at that time) achievable 1 Gbps such that it was not possible to achieve promising results just by tuning some parameters. We wanted to find breakthrough solutions. When we started the work on the proposal we discussed the challenges to be addressed in order to advancing the wireless communication speed significantly. Having the fundamental Shannon boundary in mind we discussed how to achieve the 100 Gbps speed.}, subject = {100 Gbps; Wireless; Drahtlos; End2End100; Communication protocol processing; Kommunikations-Protokoll-Prozessierung; Drahtloses Sensorsystem; Hochfrequenztechnik; Antenne; Terahertzbereich; Energieffizienz}, language = {en} } @incollection{JohannsenHoeherPeitzmeieretal., author = {Johannsen, Nils L. and Hoeher, Peter A. and Peitzmeier, Nikolai and Manteuffel, Dirk}, title = {M4 : multi-mode massive MIMO}, series = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, booktitle = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, doi = {10.26127/BTUOpen-5912}, publisher = {BTU Cottbus - Senftenberg}, pages = {167 -- 212}, abstract = {In 2012 a group of researchers proposed a basic research initiative to the German Research Foundation (DFG) as a special priority project (SPP) with the name: Wireless 100 Gbps and beyond. The main goal of this initiative was the investigation of architectures, technologies and methods to go well beyond the state of the art. The target of 100 Gbps was set far away from the (at that time) achievable 1 Gbps such that it was not possible to achieve promising results just by tuning some parameters. We wanted to find breakthrough solutions. When we started the work on the proposal we discussed the challenges to be addressed in order to advancing the wireless communication speed significantly. Having the fundamental Shannon boundary in mind we discussed how to achieve the 100 Gbps speed.}, subject = {100 Gbps; Wireless; Drahtlos; M4; Multi-mode massive MIMO; Multi-Mode-massiv-MIMO; Drahtloses Sensorsystem; Hochfrequenztechnik; Antenne; Terahertzbereich; Energieffizienz}, language = {en} } @incollection{ScheyttJavedBhutanietal., author = {Scheytt, J. Christoph and Javed, Abdul Rehman and Bhutani, Akanksha and Zwick, Thomas and Kallfass, Ingmar and Bamidi, Eswara Rao and Krishnegowda, Karthik and Kraemer, Rolf}, title = {Real100G : ultrabroadband wireless communication at high mm-wave frequencies}, series = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, booktitle = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, doi = {10.26127/BTUOpen-5913}, publisher = {BTU Cottbus - Senftenberg}, pages = {213 -- 230}, abstract = {In 2012 a group of researchers proposed a basic research initiative to the German Research Foundation (DFG) as a special priority project (SPP) with the name: Wireless 100 Gbps and beyond. The main goal of this initiative was the investigation of architectures, technologies and methods to go well beyond the state of the art. The target of 100 Gbps was set far away from the (at that time) achievable 1 Gbps such that it was not possible to achieve promising results just by tuning some parameters. We wanted to find breakthrough solutions. When we started the work on the proposal we discussed the challenges to be addressed in order to advancing the wireless communication speed significantly. Having the fundamental Shannon boundary in mind we discussed how to achieve the 100 Gbps speed.}, subject = {100 Gbps; Wireless; Drahtlos; Real100G; Ultrabroadband wireless communication; Ultrabreitband-drahtlos-Kommunikation; Drahtloses Sensorsystem; Hochfrequenztechnik; Antenne; Terahertzbereich; Energieffizienz}, language = {en} } @incollection{TestaCartaEllingeretal., author = {Testa, Paolo Valerio and Carta, Corrado and Ellinger, Frank and Klein, Bernhard and Hahnel, Ronny and Plettemeier, Dirk}, title = {DAAB : on-chip integrated distributed amplifier and antenna systems in locally-backside-etched SiGe BiCMOS for receivers with ultra-large bandwidth}, series = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, booktitle = {Wireless 100 Gbps and beyond : architectures, approaches and findings of German Research Foundation (DFG) Priority Programme SPP1655}, doi = {10.26127/BTUOpen-5910}, publisher = {BTU Cottbus - Senftenberg}, pages = {109 -- 138}, abstract = {In 2012 a group of researchers proposed a basic research initiative to the German Research Foundation (DFG) as a special priority project (SPP) with the name: Wireless 100 Gbps and beyond. The main goal of this initiative was the investigation of architectures, technologies and methods to go well beyond the state of the art. The target of 100 Gbps was set far away from the (at that time) achievable 1 Gbps such that it was not possible to achieve promising results just by tuning some parameters. We wanted to find breakthrough solutions. When we started the work on the proposal we discussed the challenges to be addressed in order to advancing the wireless communication speed significantly. Having the fundamental Shannon boundary in mind we discussed how to achieve the 100 Gbps speed.}, subject = {100 Gbps; Wireless; Drahtlos; DAAB; Drahtloses Sensorsystem; Hochfrequenztechnik; Antenne; Terahertzbereich; Energieffizienz}, language = {en} } @phdthesis{Liu2021, author = {Liu, Ke}, title = {Parallel constraint solving for combinatorial problems}, doi = {10.26127/BTUOpen-5399}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-53999}, school = {BTU Cottbus - Senftenberg}, year = {2021}, abstract = {With parallelism becoming the standard in computer design, research on parallel constraint solving technique is of vital importance for enhancing the performance of constraint solving. In this dissertation, we reviewed the literature on exploiting parallelism in constraint solving to help gain insight into the rationale of different types of parallel constraint solving approaches. On this basis, we analyzed the effectiveness of parallel constraint solving, with the focus on obtaining a first solution when solving computationally hard combinatorial problems. We have shown that a well-designed search space splitting method and constraint programming model can enable the embarrassingly parallel search (EPS) to solve some open instances of the social golfer problem that have not been solved by a sequential algorithm. We also observed superlinear speedups when solving these instances, which confirms our theoretical analysis. Besides, we examined two practical constraint optimization problems, including the traveling tournament problem with predefined venues and the talent scheduling problem. Our proposed constraint models outperformed the existing models on the same instances, and the EPS approach could always attain better feasible solutions in terms of the optimal objective value by using more parallel processors. To explore the use of massively parallel processing, we proposed the parallel stochastic portfolio search, which is a simple and non-intrusive way to parallelize different incarnations of a sequential solver. When comparing the existing portfolio to our portfolio approach by solving the same constraint satisfaction problems using the same constraint models, our technique could solve harder and larger instances. The successes of our new parallel approaches are attributed to early diversity; i.e., some diversity early in the search introduced by parallelism can offset early mistakes caused by weak heuristic choices. Unlike the other techniques (e.g., limited discrepancy search) used to overcome early mistakes, the studied two parallel constraint solving approaches not only can explore more nodes simultaneously but also does not sacrifice the guarantee of completeness. We also presented a hypertree decomposition method that builds a degenerate decomposition tree for a given constraint network, in which each node of the decomposition tree possesses and executes a subset of constraints of the given constraint network. The usefulness of our proposed parallel techniquedepends on whether we can find an efficient way to join the results of each node.}, subject = {Parallel constraint solving; Parallel computing; Constraint programing; Constraint-Programmierung; L{\"o}sen von Zwangsbedingungen; Paralleles Rechnen; SGP; Constraint-Programmierung; Parallelverarbeitung}, language = {en} }