Náklady na posádky v aerolinkách jsou po nákladech na palivo druhé největší. Cílem aerolinky je zajistit bezpečný provoz s minimálním počtem posádek a tím optimalizovat náklady. Práce popisuje metodiku odhadu počtu posádek na roční období. Používá přiřazení, ve kterém je každému dnu člena posádky přiřazena činnost, kterou vykonává. V práci je popsán nelineární model, který využívá přiřazení a následně agreguje dny pro získání celkového počtu posádek. Model je řešen v programu Premium Solver Platform a Lingu 7.

This thesis is concerned with the channel assignment (CA) problem in multi-channel multi-interface wireless mesh networks (M2WNs). First, for M2WNs with general topologies, we rigorously demonstrate using the combinatorial principle of inclusion/exclusion that the CA solution space can be quantified, indicating that its cardinality is greatly influenced by the number of radio interfaces installed on each router. Based on this analysis, a novel scheme is developed to construct a new reduced search space, represented by a lattice structure, that is searched more efficiently for a CA solution. The elements in the reduced lattice-based space, labeled Solution Structures (SS), represent groupings of feasible CA solutions satisfying the radio constraints at each node. Two algorithms are presented for searching the lattice structure. The first is a greedy algorithm that finds a good SS in polynomial time, while the second provides a user-controlled depthfirst search for the optimal SS. The obtained SS is used to construct an unconstrained weighted graph coloring problem which is then solved to satisfy the soft interference constraints. For the special class of full M2WNs (fM2WNs), we show that an optimal CA solution can only be achieved with a certain number of channels; we denote this number as the characteristic channel number and derive upper and lower bounds for that number as a function of the number of radios per router. Furthermore, exact values for the required channels for minimum interference are obtained when certain relations between the number of routers and the radio interfaces in a given fM2WN are satisfied. These bounds are then employed to develop closed-form expressions for the minimum channel interference that achieves the maximum throughput for uniform traffic on all communication links. Accordingly, a polynomial-time algorithm to find a near-optimal solution for the channel assignment problem in fM2WN is developed. Experimental results confirm the obtained theoretical results and demonstrate the performance of the proposed schemes.

This thesis is concerned with the channel assignment (CA) problem in multi-channel multi-interface wireless mesh networks (M2WNs). First, for M2WNs with general topologies, we rigorously demonstrate using the combinatorial principle of inclusion/exclusion that the CA solution space can be quantified, indicating that its cardinality is greatly influenced by the number of radio interfaces installed on each router. Based on this analysis, a novel scheme is developed to construct a new reduced search space, represented by a lattice structure, that is searched more efficiently for a CA solution. The elements in the reduced lattice-based space, labeled Solution Structures (SS), represent groupings of feasible CA solutions satisfying the radio constraints at each node. Two algorithms are presented for searching the lattice structure. The first is a greedy algorithm that finds a good SS in polynomial time, while the second provides a user-controlled depthfirst search for the optimal SS. The obtained SS is used to construct an unconstrained weighted graph coloring problem which is then solved to satisfy the soft interference constraints. For the special class of full M2WNs (fM2WNs), we show that an optimal CA solution can only be achieved with a certain number of channels; we denote this number as the characteristic channel number and derive upper and lower bounds for that number as a function of the number of radios per router. Furthermore, exact values for the required channels for minimum interference are obtained when certain relations between the number of routers and the radio interfaces in a given fM2WN are satisfied. These bounds are then employed to develop closed-form expressions for the minimum channel interference that achieves the maximum throughput for uniform traffic on all communication links. Accordingly, a polynomial-time algorithm to find a near-optimal solution for the channel assignment problem in fM2WN is developed. Experimental results confirm the obtained theoretical results and demonstrate the performance of the proposed schemes.

This thesis is concerned with the channel assignment (CA) problem in multi-channel multi-interface wireless mesh networks (M2WNs). First, for M2WNs with general topologies, we rigorously demonstrate using the combinatorial principle of inclusion/exclusion that the CA solution space can be quantified, indicating that its cardinality is greatly influenced by the number of radio interfaces installed on each router. Based on this analysis, a novel scheme is developed to construct a new reduced search space, represented by a lattice structure, that is searched more efficiently for a CA solution. The elements in the reduced lattice-based space, labeled Solution Structures (SS), represent groupings of feasible CA solutions satisfying the radio constraints at each node. Two algorithms are presented for searching the lattice structure. The first is a greedy algorithm that finds a good SS in polynomial time, while the second provides a user-controlled depthfirst search for the optimal SS. The obtained SS is used to construct an unconstrained weighted graph coloring problem which is then solved to satisfy the soft interference constraints. For the special class of full M2WNs (fM2WNs), we show that an optimal CA solution can only be achieved with a certain number of channels; we denote this number as the characteristic channel number and derive upper and lower bounds for that number as a function of the number of radios per router. Furthermore, exact values for the required channels for minimum interference are obtained when certain relations between the number of routers and the radio interfaces in a given fM2WN are satisfied. These bounds are then employed to develop closed-form expressions for the minimum channel interference that achieves the maximum throughput for uniform traffic on all communication links. Accordingly, a polynomial-time algorithm to find a near-optimal solution for the channel assignment problem in fM2WN is developed. Experimental results confirm the obtained theoretical results and demonstrate the performance of the proposed schemes.

This thesis is concerned with the channel assignment (CA) problem in multi-channel multi-interface wireless mesh networks (M2WNs). First, for M2WNs with general topologies, we rigorously demonstrate using the combinatorial principle of inclusion/exclusion that the CA solution space can be quantified, indicating that its cardinality is greatly influenced by the number of radio interfaces installed on each router. Based on this analysis, a novel scheme is developed to construct a new reduced search space, represented by a lattice structure, that is searched more efficiently for a CA solution. The elements in the reduced lattice-based space, labeled Solution Structures (SS), represent groupings of feasible CA solutions satisfying the radio constraints at each node. Two algorithms are presented for searching the lattice structure. The first is a greedy algorithm that finds a good SS in polynomial time, while the second provides a user-controlled depthfirst search for the optimal SS. The obtained SS is used to construct an unconstrained weighted graph coloring problem which is then solved to satisfy the soft interference constraints. For the special class of full M2WNs (fM2WNs), we show that an optimal CA solution can only be achieved with a certain number of channels; we denote this number as the characteristic channel number and derive upper and lower bounds for that number as a function of the number of radios per router. Furthermore, exact values for the required channels for minimum interference are obtained when certain relations between the number of routers and the radio interfaces in a given fM2WN are satisfied. These bounds are then employed to develop closed-form expressions for the minimum channel interference that achieves the maximum throughput for uniform traffic on all communication links. Accordingly, a polynomial-time algorithm to find a near-optimal solution for the channel assignment problem in fM2WN is developed. Experimental results confirm the obtained theoretical results and demonstrate the performance of the proposed schemes.

{This study analyses approaches to generation of unique assignments for teaching purposes and their potential usefulness for computer labs of assemblers course. Based on that research we design and implement system for creating pseudo unique assignments. As part of the work is also included web application for use directly during course and other tools aiding further work with system itself.

Le droit d'auteur – dont l'identité reste controversée – n'échappe pas à la discussion quant à la nature et au régime des contrats qui le mettent en œuvre. D'une terminologie légale ancrée dans une certaine tradition, mais hasardeuse, on infère l'originalité de l'ensemble des contrats de la matière. Or, la spécificité n'est sur ce point qu'apparente. De l'édition littéraire aux contrats de l'audiovisuel et aux œuvres diffusées sur les réseaux, l'analyse démontre que si l'auteur peut "céder" son œuvre – ce que dit la loi – il peut aussi la louer, c'est-à-dire en concéder la licence – ce qu'elle ne dit pas. Ce constat s'appuie sur une méthode de lecture renouvelée des contrats du droit d'auteur. L'attention portée par la loi impérative à certains contrats (édition, production audiovisuelle, etc.), a pu perturber l'étude de la licence, l'acte par lequel l'auteur se borne à autoriser l'exploitation de son œuvre pour un temps. Or, si la licence apparaît dans un premier temps en contrat spécial du droit d'auteur, elle sera également amenée à devenir la composante élémentaire d'un contrat complexe organisant une exploitation. Il importe donc de distinguer ces deux objets pour mieux en apprécier ensuite les interactions. Le droit d'auteur, droit "spécial", fait ainsi la preuve de son aptitude à accueillir - autant que de raison - les mécanismes du droit des contrats, droit "commun". Cette étude a pour ambition une meilleure compréhension de cette matière complexe des contrats du droit d'auteur, sans omettre le principal objectif de notre loi : la protection de l'auteur. / In the field of the author's right (a concept with a controversial identity), the nature and regime of many contracts is a subject for debate. A traditional but somehow uncertain terminology has often led to infer the originality of most of these contracts. However, this peculiarity is only apparent. From literary publishing to audiovisual contracts through creations published on networks, not only can the author of a work "assign" it – as stated by the law – but also rent it, or in other words license it – even though the law does not state it. This observation rests on a renewed reading method applied to the author's right contracts. Focusing on some of these contracts (e. g. books publishing, audiovisual production, etc.), mandatory copyright law hindered the study of license itself, i. e. the act by which an author authorizes the exploitation of his work for a fixed time. License is a special contract in the field of author's right ; it is also a basis element in a complex agreement designed to organize an exploitation. These two objects should therefore be distinguished and their interactions thoroughly analysed. A "special" right, the author's right nevertheless proves able to host (to a certain extent) the typical process of contract right – a "common" right. The present study aims to attain a better understanding of a complex matter, the author's right contracts, not forgetting the main purpose of the law itself : the protection of the author.

Den historiska bakgrunden och tidigare forskningen kring vårt ämne pekar på en återkommande problematik inom fritidshemmet och fritidspedagogsyrket. Problematiken utgörs av en tvetydig syn på hur man ska tolka eller uppfatta det fritidspedagogiska uppdraget. Studiens syfte är därför att undersöka de målorienterade handlingar som utövas av fritidspedagoger i olika kontexter. Därmed utformar vi vår egna definition av uppdraget genom dessa målorienterade handlingar. Vi har valt att genomföra ett fältarbete av etnografisk karaktär som bygger på observationer som har ägt rum på en skola. Den här metoden anknyts till vår teori, Roger Säljös tolkning av den sociokulturella teorin, som utgår ifrån det praktiska som framträder genom kommunikativa och fysiska handlingar. Dessutom har vi genomfört informella samtal när vi har velat förtydliga fritidspedagogernas handlingar. Vår undersökning visar att fritidspedagogerna utövar ett mångsidigt uppdrag som beroende på situationen använder sig av fyra olika arbetssätt och därmed omväxlande riktar sig mot såväl skola som fritidshem. Vi uppfattar inte fritidspedagogernas uppdrag som tvetydigt, vilket den tidigare forskning vi tagit del av uppmärksammar, utan vårt resultat visar att fritidspedagogerna utövar ett tydligt uppdrag som både är målorienterat och mångsidigt. / The historical background and previous studies on our subject point to a recurrent problem in the leisure education sector. The problem consists of an ambiguous view of how the leisuretime educators should interpret or perceive their assignment. The purpose of the study is therefor to investigate the goal-oriented actions performed by leisure-time educators, in different contexts. Thus we develop our own definition of the assignment through these goaloriented actions. We have chosen to carry out a field work of ethnographic character based on observations that have taken place in a school. This method is linked to our theory, Roger Säljö's interpretation of socio-cultural theory, which is based on the practical that´s emerging through communicative and physical actions. Furthermore we have completed informal conversations when we have wished to clarify the leisure-time educator’s actions. Our study shows that the leisure-time educators execute a versatile assignment which, depending on the situation, uses four different ways of working. These approaches vary in terms of both school and leisure-time. We do not perceive the task of the leisure-time educators as ambiguous as previous studies have shown. Our results, on the other hand, show that leisure-time educators perform a clear assignment that is both goal-oriented and versatile.

Cette thèse traite du processus d’évaluation et de sélection de projets sur la base de critères multiples. Outre la capacité du modèle à permettre une identification efficace des meilleurs projets et leur intégration à un portefeuille, l’équité et la transparence sont des considérations importantes dans la conception de modèles d’appui à ce processus. Nous proposons un cadre de travail général pour l’évaluation de projets, Il reprend les codes de l’analyse SWOT, dont de nombreuses organisations orientées projets sont familières. Nos contributions apportent des éléments de réponse à la question de « l’après SWOT », à laquelle ces organisations peuvent éprouver des difficultés à répondre. Dans ce cadre de travail, nous introduisons et discutons un modèle de préférences permettant de mesurer l’importance des critères sur deux dimensions, représentant de manière indépendante leurs capacités de conviction et d’opposition. Suivant l’évaluation et en préalable à la sélection, le filtrage consiste à écarter les projets trop inadéquats. Nous proposons un mécanisme basé sur la dominance pour effectuer cette opération. Nous proposons, enfin, deux méthodes de sélection de projets, chacune étant basée sur une procédure d’agrégation multicritère originale. La première méthode, SPADE (pour Structure de Préférence pour l’Aide à la Décision) est une approche de surclassement, destinée à des contextes où les préférences exprimées concernent essentiellement les projets individuels, et dans lesquels les décisions concernant un projet peuvent être argumentées en référence à des projets tiers. Nous garantissons la validité théorique de SPADE, en amont, ce qui permet un temps de mise en œuvre réduit et une utilisation en temps réel. En pratique, nous illustrons l’application de SPADE, en la comparant à deux autres approches d’aide multicritères à la décision, MAUT et ELECTRE, en mettant en exergue ses spécificités. La seconde méthode, RADAR (Règles d’Aide à la Décision et à l’ARgumentation) est une approche à base de règles logiques. Elle est destinée à des contextes plus contraints dans lesquels les préférences exprimées concernent à la fois les projets individuels, mais aussi le portefeuille de projets (degré de diversification, budget total, etc.). De plus, l'argumentation des décisions est ici basée exclusivement sur la qualité intrinsèque des projets en référence à une norme fixe. RADAR permet également la construction automatique de tels arguments. Nous proposons un programme linéaire en variable mixtes permettant de valider théoriquement cette approche. Cependant, sa résolution est nécessaire à chaque mise en œuvre de RADAR, ce qui limite l’application de cette approche au temps différé. Nous illustrons une telle application sur un jeu de données représentant des évaluations de projets financés par le Fond des Nations Unies pour la Démocratie (UNDEF). / Project portfolio management (PPM) involves the use of methods and tools, allowing an organization to plan, evaluate, analyze and screen the execution of a set of projects or project proposals, sharing common resources or aiming at the attainment of common objectives. Multicriteria decision aid models are useful tools to support this process, given their ability to accurately model preferences, and rationally agregate points of view. However, existing models present some lacks that limit their use outside of academic circles : (i) They neglect the non-symetrical nature of the importance of some criteria that are relevant in PPM. (ii) The black box effect makes it hard to use them for the argumentation of decisions and to gain their acceptance by users (iii) They are implicitly fitted for private/for-profit projects, which limits their use in public organizations. In this thesis, our contribution consists in proposing two multicriteria methods for supporting the activities of evaluating, selecting and arguing decision, for project portfolio management. We propose: (i) An analysis of the specific features of public and private projects and their consequences for decision support (ii) A framework that allows an independent modeling of the abilities of a criterion to oppose and convince (iii) Two transparent multicriteria agregation procedures, fitted for different decision contexts. We ensure the theoretical validity of our approaches and illustrate their applicability on real data, with satisfying results.