Syftet med denna vetenskapliga undersökning är att studera vilka element av det klassiska berättandets dramaturgi som går att finna i sex stycken olika svenskproducerade långa spelfilmer. Filmerna är uppdelade i två olika grupper, kritikerrosade och biosuccéer, dessa har valts ut med hjälp av statistik från Svenska Filminstitutet. Analysen fokuserar främst på två nyckelbegrepp, protagonisten och treaktsstrukturen, som båda definieras och sedan analyseras i vardera film. Efter analysen görs sedan jämförelser, både film mot film men även grupp mot grupp, för att besvara frågan om det finns skillnader mellan användandet av det klassiska berättandet i svenskproducerade kritikerrosade filmer och biosuccéer. Det bakomliggande syftet är att förstå hur denna konventionella berättarstruktur används i praktiken i Sverige. Undersökningen finner dock att skillnaderna mellan grupperna är mycket små och enbart en film kommer nära definitionen av det klassiska berättandet. Genomgående för filmerna är att de övriga inte har en tydlig protagonist eller huvudkonflikt, vilket i de flesta filmer resulterar i en otydlig treaktsstruktur. Detta pekar på att svenskproducerade lång spelfilmer verkar prioritera andra berättarstrukturer eller medel för att skapa intresse hos publiken.

This thesis deals with DBA algorithms used in XG-PON networks. It describes reference appearance of the DBA algorithm, as well as, three specific DBA algorithms discussed in professional articles. Particularly speaking about GIANT, HYRA and modified Max-Min Fair DBA. The thesis provides description of frames utilized by DBA algorithms in XG-PON networks, specifically XGEM frame and XGTC frames. The thesis also presents a simulation tester of DBA algorithms tested on a virtual XG-PON network. Finally, it contains the results of testing these DBA algorithms with a description.

This diploma thesis deals with the design of a partially integrated charge pump in 0.25 micron technology ACMOS. The work is divided into two main parts, theoretical and practical. The theoretical section describes in detail various topologies of higher voltage generation of a charge pump and selected methods of regulating the output voltage of charge pumps. The practical part deals with the the actual design of a charge pump together with the arguments for the choice of the TPVD topology and the type of the regulation. Three regulation methods of a charge pump were implemented, tested and are dealt with: Pulse Skip, Constant frequency and PWM. There are 3 sub chapters, each describing a different regulation method, defining all the key elements of the design of such a charge pump and the results of the simulations are discussed. Conclusion of the thesis summarizes the results of the design of charge pumps, comparing them on the basis of the chosen type of output voltage regulation.

This paper studies if the Minimax theorem holds for the behaviour of trained and untrained actors in the field. This is explored with data from 1043 football penalty kicks from professionals of the German Bundesliga and for 268 penalty kicks from untrained players. Minimax makes good predictions about the collective patterns emerging from the behaviour of experienced actors, as well as about their individual strategic actions. However, this is not true for untrained actors. In the next step it is explored if, the professional players learned their behaviour, or if they were selected into their roles because they had the required abilities. The data suggests that the professionals were selected by the competitive conditions of professional sports.

Distributed coordination of multi-agent systems (MASs) has been widely studied in various emerging engineering applications, including connected vehicles, wireless networks, smart grids, and cyber-physical systems. In these contexts, agents make the decision locally, relying on the interaction with their immediate neighbors over the connected communication networks. The study of distributed coordination for the multi-agent system (MAS) with constraints is significant yet challenging, especially in terms of ubiquitous uncertainties, the heavy communication burden, and communication delays, to name a few. Hence, it is desirable to develop distributed algorithms for the constrained MAS with these practical issues. In this dissertation, we develop the theoretical results on robust distributed model predictive control (DMPC) algorithms for two types of control problems (i.e., formation stabilization problem and consensus problem) of the constrained and uncertain MAS and apply robust DMPC algorithms in applications of cooperative marine vehicles. More precisely, Chapter 1 provides a systematic literature review, where the state-of-the-art DMPC for formation stabilization and consensus, robust MPC, and MPC for motion control of marine vehicles are introduced. Chapter 2 introduces some notations, necessary definitions, and some preliminaries. In Chapter 3, we study the formation stabilization problem of the nonlinear constrained MAS with un- certainties and bounded time-varying communication delays. We develop a min-max DMPC algorithm with the self-triggered mechanism, which significantly reduces the communication burden while ensuring closed-loop stability and robustness. Chapter 4 investigates the consensus problem of the general linear MAS with input constraints and bounded time-varying delays. We design a robust DMPC-based consensus protocol that integrates a predesigned consensus protocol with online DMPC optimization techniques. Under mild technical assumptions, the estimation errors propagated over prediction due to delay-induced inaccurate neighboring information are proved bounded, based on which a robust DMPC strategy is deliberately designed to achieve robust consensus while satisfying control input constraints. Chapter 5 proposes a Lyapunov-based DMPC approach for the formation tracking control problem of co-operative autonomous underwater vehicles (AUVs) subject to environmental disturbances. A stability constraint leveraging the extended state observer-based auxiliary control law and the associated Lyapunov function is incorporated into the optimization problem to enforce the stability and enhance formation tracking performance. A collision-avoidance cost is designed and employed in the DMPC optimization problem to further guarantee the safety of AUVs. Chapter 6 presents a tube-based DMPC approach for the platoon control problem of a group of heterogeneous autonomous surface vehicles (ASVs) with input constraints and disturbances. In particular, a coupled inter-vehicle safety constraint is added to the DMPC optimization problem; it ensures that neighboring ASVs maintain the safe distance and avoid inter-vehicle collision. Finally, we summarize the main results of this dissertation and discuss some potential directions for future research in Chapter 7. / Graduate / 2023-04-19

This work deals with the issue of swarm intelligence as a subdiscipline of artificial intelligence. It describes biological background of the dilemma briefly and presents the principles of searching paths in ant colonies as well. There is also adduced combinatorial optimization and two selected tasks are defined in detail: Travelling Salesman Problem and Quadratic Assignment Problem. The main part of this work consists of description of swarm intelligence methods for solving mentioned problems and evaluation of experiments that were made on these methods. There were tested Ant System, Ant Colony System, Hybrid Ant System and Max-Min Ant System algorithm. Within the work there were also designed and tested my own method Genetic Ant System which enriches the basic Ant System i.a. with development of unit parameters based on genetical principles. The results of described methods were compared together with the ones of classical artificial intelligence within the frame of both solved problems.

Low-Density Parity-Check (LDPC) codes are linear error-correcting codes used to establish reliable communication between units on a noisy transmission channel in mobile telecommunications. LDPC algorithms detect and recover altered or corrupted message bits using sparse parity-check matrices in order to decipher messages correctly. LDPC codes have been shown to be fitting coding schemes for the fifth generation (5G) New Radio (NR), according to the third generation partnership project (3GPP).  TietoEvry, a consultant in telecom, has discovered that optimizations of LDPC decoding algorithms can be achieved/obtained with the use of a parallel computing platform called Compute Unified Device Architecture (CUDA), developed by NVIDIA. This platform utilizes the capabilities of a graphics processing unit (GPU) rather than a central processing unit (CPU), which in turn provides parallel computing. An optimized version of an LDPC decoding algorithm, the Min-Sum Algorithm (MSA), is implemented in CUDA and in C++ for comparison in terms of CPU execution time, to explore the capabilities that CUDA offers. The testing is done with a set of 12 sparse parity-check matrices and input-channel messages with different sizes. As a result, the CUDA implementation executes approximately 55% faster than a standard, unoptimized C++ implementation.

No description available.

This thesis focuses mainly on the Maximum Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph classes defined by a set F of forbidden induced subgraphs. We revise the literature about the issue, for example complexity results, applications, and techniques tackling the problem. Through considering some general approach, we exhibit several cases where the problem admits a polynomial-time solution. More specifically, we present polynomial-time algorithms for the MIS problem in: + some subclasses of $S_{2;j;k}$-free graphs (thus generalizing the classical result for $S_{1;2;k}$-free graphs); + some subclasses of $tree_{k}$-free graphs (thus generalizing the classical results for subclasses of P5-free graphs); + some subclasses of $P_{7}$-free graphs and $S_{2;2;2}$-free graphs; and various subclasses of graphs of bounded maximum degree, for example subcubic graphs. Our algorithms are based on various approaches. In particular, we characterize augmenting graphs in a subclass of $S_{2;k;k}$-free graphs and a subclass of $S_{2;2;5}$-free graphs. These characterizations are partly based on extensions of the concept of redundant set [125]. We also propose methods finding augmenting chains, an extension of the method in [99], and finding augmenting trees, an extension of the methods in [125]. We apply the augmenting vertex technique, originally used for $P_{5}$-free graphs or banner-free graphs, for some more general graph classes. We consider a general graph theoretical combinatorial problem, the so-called Maximum -Set problem. Two special cases of this problem, the so-called Maximum F-(Strongly) Independent Subgraph and Maximum F-Induced Subgraph, where F is a connected graph set, are considered. The complexity of the Maximum F-(Strongly) Independent Subgraph problem is revised and the NP-hardness of the Maximum F-Induced Subgraph problem is proved. We also extend the augmenting approach to apply it for the general Maximum Π -Set problem. We revise on classical graph transformations and give two unified views based on pseudo-boolean functions and αff-redundant vertex. We also make extensive uses of α-redundant vertices, originally mainly used for $P_{5}$-free graphs, to give polynomial solutions for some subclasses of $S_{2;2;2}$-free graphs and $tree_{k}$-free graphs. We consider some classical sequential greedy heuristic methods. We also combine classical algorithms with αff-redundant vertices to have new strategies of choosing the next vertex in greedy methods. Some aspects of the algorithms, for example forbidden induced subgraph sets and worst case results, are also considered. Finally, we restrict our attention on graphs of bounded maximum degree and subcubic graphs. Then by using some techniques, for example ff-redundant vertex, clique separator, and arguments based on distance, we general these results for some subclasses of $S_{i;j;k}$-free subcubic graphs.

The thesis focuses on the privacy of communication that can be ensured by means of the physical layer, i.e., by appropriately chosen coding and resource allocation schemes. The fundamentals of physical-layer security have been already formulated in the 1970s by Wyner (1975), Csiszár and Körner (1978). But only nowadays we have the technical progress such that these ideas can find their way in current and future communication systems, which has driven the growing interest in this area of research in the last years. We analyze two physical-layer approaches that can ensure the secret transmission of private information in wireless systems in presence of an eavesdropper. One is the direct transmission of the information to the intended receiver, where the transmitter has to simultaneously ensure the reliability and the secrecy of the information. The other is a two-phase approach, where two legitimated users first agree on a common and secret key, which they use afterwards to encrypt the information before it is transmitted. In this case, the secrecy and the reliability of the transmission are managed separately in the two phases. The secrecy of the transmitted messages mainly depends on reliable information or reasonable and justifiable assumptions about the channel to the potential eavesdropper. Perfect state information about the channel to a passive eavesdropper is not a rational assumption. Thus, we introduce a deterministic model for the uncertainty about this channel, which yields a set of possible eavesdropper channels. We consider the optimization of worst-case rates in systems with multi-antenna Gaussian channels for both approaches. We study which transmit strategy can yield a maximum rate if we assume that the eavesdropper can always observe the corresponding worst-case channel that reduces the achievable rate for the secret transmission to a minimum. For both approaches, we show that the resulting max-min problem over the matrices that describe the multi-antenna system can be reduced to an equivalent problem over the eigenvalues of these matrices. We characterize the optimal resource allocation under a sum power constraint over all antennas and derive waterfilling solutions for the corresponding worst-case channel to the eavesdropper for a constraint on the sum of all channel gains. We show that all rates converge to finite limits for high signal-to-noise ratios (SNR), if we do not restrict the number of antennas for the eavesdropper. These limits are characterized by the quotients of the eigenvalues resulting from the Gramian matrices of both channels. For the low-SNR regime, we observe a rate increase that depends only on the differences of these eigenvalues for the direct-transmission approach. For the key generation approach, there exists no dependence from the eavesdropper channel in this regime. The comparison of both approaches shows that the superiority of an approach over the other mainly depends on the SNR and the quality of the eavesdropper channel. The direct-transmission approach is advantageous for low SNR and comparably bad eavesdropper channels, whereas the key generation approach benefits more from high SNR and comparably good eavesdropper channels. All results are discussed in combination with numerous illustrations. / Der Fokus dieser Arbeit liegt auf der Abhörsicherheit der Datenübertragung, die auf der Übertragungsschicht, also durch geeignete Codierung und Ressourcenverteilung, erreicht werden kann. Die Grundlagen der Sicherheit auf der Übertragungsschicht wurden bereits in den 1970er Jahren von Wyner (1975), Csiszár und Körner (1978) formuliert. Jedoch ermöglicht erst der heutige technische Fortschritt, dass diese Ideen in zukünftigen Kommunikationssystemen Einzug finden können. Dies hat in den letzten Jahren zu einem gestiegenen Interesse an diesem Forschungsgebiet geführt. In der Arbeit werden zwei Ansätze zur abhörsicheren Datenübertragung in Funksystemen analysiert. Dies ist zum einen die direkte Übertragung der Information zum gewünschten Empfänger, wobei der Sender gleichzeitig die Zuverlässigkeit und die Abhörsicherheit der Übertragung sicherstellen muss. Zum anderen wird ein zweistufiger Ansatz betrachtet: Die beiden Kommunikationspartner handeln zunächst einen gemeinsamen sicheren Schlüssel aus, der anschließend zur Verschlüsselung der Datenübertragung verwendet wird. Bei diesem Ansatz werden die Abhörsicherheit und die Zuverlässigkeit der Information getrennt voneinander realisiert. Die Sicherheit der Nachrichten hängt maßgeblich davon ab, inwieweit zuverlässige Informationen oder verlässliche Annahmen über den Funkkanal zum Abhörer verfügbar sind. Die Annahme perfekter Kanalkenntnis ist für einen passiven Abhörer jedoch kaum zu rechtfertigen. Daher wird hier ein deterministisches Modell für die Unsicherheit über den Kanal zum Abhörer eingeführt, was zu einer Menge möglicher Abhörkanäle führt. Die Optimierung der sogenannten Worst-Case-Rate in einem Mehrantennensystem mit Gaußschem Rauschen wird für beide Ansätze betrachtet. Es wird analysiert, mit welcher Sendestrategie die maximale Rate erreicht werden kann, wenn gleichzeitig angenommen wird, dass der Abhörer den zugehörigen Worst-Case-Kanal besitzt, welcher die Rate der abhörsicheren Kommunikation jeweils auf ein Minimum reduziert. Für beide Ansätze wird gezeigt, dass aus dem resultierenden Max-Min-Problem über die Matrizen des Mehrantennensystems ein äquivalentes Problem über die Eigenwerte der Matrizen abgeleitet werden kann. Die optimale Ressourcenverteilung für eine Summenleistungsbeschränkung über alle Sendeantennen wird charakterisiert. Für den jeweiligen Worst-Case-Kanal zum Abhörer, dessen Kanalgewinne einer Summenbeschränkung unterliegen, werden Waterfilling-Lösungen hergeleitet. Es wird gezeigt, dass für hohen Signal-Rausch-Abstand (engl. signal-to-noise ratio, SNR) alle Raten gegen endliche Grenzwerte konvergieren, wenn die Antennenzahl des Abhörers nicht beschränkt ist. Die Grenzwerte werden durch die Quotienten der Eigenwerte der Gram-Matrizen beider Kanäle bestimmt. Für den Ratenanstieg der direkten Übertragung ist bei niedrigem SNR nur die Differenz dieser Eigenwerte maßgeblich, wohingegen für den Verschlüsselungsansatz in dem Fall keine Abhängigkeit vom Kanal des Abhörers besteht. Ein Vergleich zeigt, dass das aktuelle SNR und die Qualität des Abhörkanals den einen oder anderen Ansatz begünstigen. Die direkte Übertragung ist bei niedrigem SNR und verhältnismäßig schlechten Abhörkanälen überlegen, wohingegen der Verschlüsselungsansatz von hohem SNR und vergleichsweise guten Abhörkanälen profitiert. Die Ergebnisse der Arbeit werden umfassend diskutiert und illustriert.