Teses / dissertações sobre o tema "Transfert asynchrone"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Veja os 50 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Transfert asynchrone".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Veja as teses / dissertações das mais diversas áreas científicas e compile uma bibliografia correta.
Coelho, Rosângela. "Analyse et contrôle du trafic vidéo à débit variable dans le réseaux ATM /". Paris : Ecole nationale supérieure des télécommunications, 1995. http://catalogue.bnf.fr/ark:/12148/cb358187893.
Texto completo da fonteLauvergne, Muriel. "Réservation de connexions avec reroutage pour les réseaux ATM : une approche hybride par programmation par contraintes". Nantes, 2002. http://www.theses.fr/2002NANT2004.
Texto completo da fonteFontanili, Franck. "Integration d'outils de simulation et d'optimisation pour le pilotage d'une ligne d'assemblage multiproduit a transfert asynchrone". Paris 13, 1999. http://www.theses.fr/1999PA132037.
Texto completo da fonteZhang, Jian Ping. "Contrôle de flux pour le service ABR des réseaux ATM : équité et efficacité". Versailles-St Quentin en Yvelines, 1998. http://www.theses.fr/1998VERS0010.
Texto completo da fonteGalinec, David. "Exécution asynchrone de programmes synchrones par transformations automatiques : application au traitement d'images temps-réel". Lille 1, 1997. http://www.theses.fr/1997LIL10054.
Texto completo da fonteBoukhatem, Nadia. "L'approche multi-agents pour un contrôle de congestion adaptatif de réseaux atm". Versailles-St Quentin en Yvelines, 1998. http://www.theses.fr/1998VERS0021.
Texto completo da fonteEchchelh, Zouhair. "Qualité de service et allocation de ressources dans les réseaux ATM et MPLS". Dijon, 2001. http://www.theses.fr/2001DIJOS047.
Texto completo da fonteBarnault, Loïc. "Optimisation de la démodulation et du codage pour une communication sporadique de faible latence". Cergy-Pontoise, 2006. http://www.theses.fr/2006CERG0303.
Texto completo da fonteThe aim of this thesis consist in proposing a powerful communication system for satellite transmissions where the constraints put on the QoS and the spectral efficiency cannot be handled by existing systems. We work in a context of satellite communications where small packets are transmitted. Typically, the combinations code-modem which are proposed for spectral efficiencies in [0. 5,0. 8] are unbalanced in term of performance. The system we propose in this thesis is based on the 3PSK constellation which possesses a better demodulation capacity than BPSK or QPSK. In order to improve the cohabitation code-modem, we propose to associate a ternary burst modem with powerful ternary codes (TPC & LDPC). Finally, we show, after optimizations of the global system, that in the range of spectral efficiencies [0. 5,0. 8], our systems exhibit better performances than their binary counterparts
Tourki, Kamel. "Conception et optimisation de protocoles de coopération pour les communications sans fil". Nice, 2008. http://www.theses.fr/2008NICE4006.
Texto completo da fonteCooperative mechanisms are becoming increasingly important in wireless communications and networks to substantially enhance system performance with respect to much less power consumption, higher system capacity and smaller packet loss rate. The idea of cooperation can be traced back to the information theory investigation on relay channel in cellular network. From the system point of view, since Mobile Station (MS) has limitations in single antenna, power, cost and hardware, it is infeasible to use MIMO technology in MS. Mobile users with single antennas can still take advantage of spatial diversity through cooperative space-time encoded transmission. The objective of this thesis is to introduce and discuss various cooperative strategies in wireless communications. In the first part, we present an end-to-end performance analysis of two-hop asynchronous cooperative diversity with regenerative relays over Rayleigh block-flat-fading channels, in which a precoding frame-based scheme with packet-wise encoding is used. This precoding is based on the addition of a cyclic prefix which is implemented as a training sequence. We derive, for equal and unequal sub-channel gains, the bit-error rate and the end-to-end bit-error rate expressions for binary phase-shift keying. We also present the performance of the frame-error rate and the end-to-end frame-error rate. Finally, comparisons between three system configurations, differing by the amount of cooperation, are presented. The second part contains two chapters. In the first chapter, we consider a scheme in which a relay chooses to cooperate only if its source-relay channel is of an acceptable quality and we evaluate the usefulness of relaying when the source acts blindly and ignores the decision of the relays whether they may cooperate or not. In our study, we consider the regenerative relays in which the decisions to cooperate are based on a signal-to-noise ratio (SNR) threshold and consider the impact of the possible erroneously detected and transmitted data at the relays. We derive the end-to-end bit-error rate (BER) for binary phase-shift keying modulation and look at two power allocation strategies between the source and the relays in order to minimize the end-to-end BER at the destination for high SNR. In the second chapter, we consider a scheme in which the relay chooses to cooperate only if the source-destination channel is of an unacceptable quality. In our study, we consider a regenerative relay in which the decision to cooperate is based on a signal-to-noise ratio (SNR) threshold and consider the effect of the possible erroneously detected and transmitted data at the relay. We derive an expression for the end-to-end bit-error rate (BER) of binary phase-shift keying (BPSK) modulation and look at the optimal strategy to minimize this end-to-end BER at the destination for high SNR. In the third part, we consider a multiple access MAC fading channel with two users communicating with a common destination, where each user mutually acts as a relay for the other one as well as wishes to transmit his own information as opposed to having dedicated relays. We wish to evaluate the usefulness of relaying from the point of view of the system's throughput (sum rate) rather than from the sole point of view of the user benefiting from the cooperation as is typically done. We do this by allowing a trade-off between relaying and fresh data transmission through a resource allocation framework. Specifically, we propose cooperative transmission scheme allowing each user to allocate a certain amount of power for his own transmitted data while the rest is devoted to relaying. The underlying protocol is based on a modification of the so-called non-orthogonal amplify and forward (NAF) protocol. We develop capacity expressions for our scheme and derive the rate-optimum power allocation, in closed form for centralized and distributed frameworks. In the distributed scenario, partially statistical and partially instantaneous channel information is exploited. The centralized power allocation algorithm indicates that even in a mutual cooperation setting like ours, on any given realization of the channel, cooperation is never truly mutual, i. E. One of the users will always allocate zero power to relaying the data of the other one, and thus act selfishly. But in distributed framework, our results indicate that the sum rate is maximized when both mobiles act selfishly
Présent, Dominique. "Architecture d'interconnexion de cartes de commutation ATM par bus optique". Versailles-St Quentin en Yvelines, 1996. http://www.theses.fr/1996VERS0006.
Texto completo da fonteBeylot, André-Luc. "Modèles de trafics et de commutateurs pour l'évaluation de la perte et du délai dans les réseaux ATM". Paris 6, 1993. http://www.theses.fr/1993PA066311.
Texto completo da fonteMokdad, Nadia Lynda. "Méthodes et outils pour l'évaluation des performances des réseaux informatiques". Versailles-St Quentin en Yvelines, 1997. http://www.theses.fr/1997VERS0011.
Texto completo da fonteWu, Jiyong. "Contribution à l'étude d'une chaîne de télécommunication privée haut débit à intégration de services (B-ISDN) : version non confidentielle /". Paris : École nationale supérieure des télécommunications, 1991. http://catalogue.bnf.fr/ark:/12148/cb355858407.
Texto completo da fonteBonnin, David. "Algorithmique distribuée asynchrone avec une majorité de pannes". Thesis, Bordeaux, 2015. http://www.theses.fr/2015BORD0264/document.
Texto completo da fonteIn distributed computing, asynchronous message-passing model with crashes is well-known and considered in many articles, because of its realism and it issimple enough to be used and complex enough to represent many real problems.In this model, n processes communicate by exchanging messages, but withoutany bound on communication delays, i.e. a message may take an arbitrarilylong time to reach its destination. Moreover, up to f among the n processesmay crash, and thus definitely stop working. Those crashes are undetectablebecause of the system asynchronism, and restrict the potential results in thismodel.In many cases, known results in those systems must verify the propertyof a strict minority of crashes. For example, this applies to implementationof atomic registers and solving of renaming. This barrier of a majority ofcrashes, explained by the CAP theorem, restricts numerous problems, and theasynchronous message-passing model with a majority of crashes is thus notwell-studied and rather unknown. Hence, studying what can be done in thiscase of a majority of crashes is interesting.This thesis tries to analyse this model, through two main problems. The first part studies the implementation of shared objects, similar to usual registers,by defining x-colored register banks, and α-registers. The second partextends the renaming problem into k-redundant renaming, for both one-shotand long-lived versions, and similarly for the shared objects called splitters intok-splitters
Jiang, Shengming. "Techniques de contrôle d'accès à haut débit basées sur l'ATM pour les applications multimédia". Versailles-St Quentin en Yvelines, 1995. http://www.theses.fr/1995VERS0001.
Texto completo da fonteHamek, Saliha. "La coopération asynchrone dans les environnements dynamiques : le cas de la gestion des soins". Paris 8, 2007. http://www.theses.fr/2007PA084191.
Texto completo da fonteThis work aims at enlarging the research field of asynchronous cooperation. We adopt the perspective of working conditions in which the actors are placed in a time asynchronous situation implying sequential and delayed interdependences between them. Models and methods from the ergonomic psychology domain were used to carry out four studies. The work focuses particularly on the possibility of determining and maintaining a common frame of reference by nurses who take care of patients hospitalized at home (H. A. D. In French). The first one defines the organization of H. A. D activity and specifies the cognitive artefacts, which serve as a support for the functional structure of the horizontal cooperation. The second study describes structural cooperation this sequential and time delayed on a coordination implying a strong cognitive synchronization to maintain a common frame of reference. The third study analyses the representations expressed during the care providing process and shows that health care professionals can rebuild the coupling by adding the individuals representations, for which members they do not have a direct and synchronized access. The last study focuses on the “competence required to cooperate” by each coordination experience - priming and facilitation - in the cases of sequential and time delayed interactions for a collective adaptation reinforced progressively towards the maintenance of it he cognitive synchronization of the common frame of reference
Kotuliak, Ivan. "Feasibility study of optical packet switching network : performance evaluation". Versailles-St Quentin en Yvelines, 2003. http://www.theses.fr/2003VERS0021.
Texto completo da fonteOptical technology supplies capabilities necessary to create an optical packet switching network providing large bandwidth, high-speed data transmission and service differentiation. The aim of this thesis work is a logical performance analysis of optical packet-switching network. Studied network is based on the synchronous optical packet switching. Main part of this work deals with the analysis of two architectures: interior switch and access node. Two interior node architectures are proposed: a memory less switch and switch incorporating memory buffers based on the fiber delay lines. The access node is studied with focus on its ingress functions. Two algorithms of optical packet creation are considered: assembly and segmentation. Performance of proposed nodes is evaluated using simulation tool and discrete-time Markov chain. We show that optical packet switching network performs very well under different conditions and it is one of the promising solutions for the future high-speed networks
Amedro, Brian. "Optimizing an active object framework from multi-cores to multi-clouds". Nice, 2010. http://www.theses.fr/2010NICE4092.
Texto completo da fonteModern processors become massively multi-cores, and clusters become clouds. Within a few years, we may even speak about HPC as High Performance Clouds. This openness makes com- puting platforms more accessible and induces a increasing interest in programming languages adapted to these hybrid shared/distributed memory architectures. This PhD Thesis presents the design, implementation and evaluation of several solutions to optimize the execution of HPC numerical applications in such situation. We propose some extensions to the asynchronous communicating Active Objects model ASP (Asynchronous Sequential Process), with constructs that improve the execution of applica- tions. In particular, this work explores the era of asynchronous communications between activities, by studying the different properties that can be ensured. Thus, we proposes various language constructs or rather general middleware approaches based on the behavior of the program to optimize communications. Another contribution of this thesis consists in an advanced analysis of the performance of a middleware-based ASP model for high performance applications. This work is based on ProActive, a Java implementation of the model, which has been evaluated in a heterogeneous context characterized by the subtitle of this manuscript "from multi-cores to multi-clouds"
Chaudhuri, Sumanta. "Architectures des FPGAs asynchrones pour les applications cryptographiques". Phd thesis, Paris, ENST, 2009. https://pastel.hal.science/pastel-00006190.
Texto completo da fonteCryptography is a mean to defend against potential attackers, notably to protect confidentiality, integrity or secure authentication, whereas cryptanalysis is about the challenge to retrieve hidden information. No mathematical cryptanalysis method can decrypt modern cryptographic algorithms such as AES, DES. But the leak of information related to the workings of these machines, or manipulation of these machines to find the secret key has become a powerful means of cryptanalysis. These attacks are known as "Side-Channel Attacks". This thesis attempts to find answers to the following questions : • Is there an architecture whose information leakage does not allow the attacker to recover the key faster than the case where there is no leakage ?• To what extent are this leakage is tolerable, and how can we maximize the use of these machines without compromising their secret ?• What are the metrics to determine the vulnerability of electronic circuits facing a multitude of ways to attack? Recently numerous researchers have asked these questions for the various categories of electronic circuits. In this thesis we restrict our research space to FPGAs and Asynchronous Circuits. The main advantage of FPGAs is their reconfigurability, which can be used to adapt the algorithm against an attack. Asynchronous circuits have good properties such as tolerance to fault, the decorrelation of power consumption and computation, which are useful against Side-Channel Attacks
Chaudhuri, Sumanta. "Architectures des FPGAs Asynchrones pour les Applications Cryptographiques". Phd thesis, Télécom ParisTech, 2009. http://pastel.archives-ouvertes.fr/pastel-00006190.
Texto completo da fonteBen, Othman Jalel. "Intégration multiservices dans un réseau ATM mobile". Versailles-St Quentin en Yvelines, 1998. http://www.theses.fr/1998VERS0019.
Texto completo da fonteFossati, Luca. "Modeling the Handshake protocal for Asychrony". Paris 7, 2009. http://www.theses.fr/2009PA077189.
Texto completo da fonteThe thesis deals with communication protocols in an asynchronous environment. It can be divided in two parts. In the first part we briefly survey existing formalisms and tools which underlie many models of asynchronous communication and we formally introduce the notions of speed-independence and delay-insensitivity. A protocol is speed-independent if it ensures correctness independently of the computational speeds of single modules. A protocol is delay-insensitive if it is speed-independent and ensures correctness independently of propagation delays in communications. The second part contains most of the original contributions. It aims at providing a formal study of the handshake protocol, a delay-insensitive protocol which requires that the two partners invouved in a communication alternats. We start by recalling [vb:93], the only previous formal model of the handshake protocol. We also identify a limitation of that model, as we show that its representation of the composition of systems is not correct. In our analysis we introduce a game semantics model, a petri nets model and a process calculus. The game semantics model is a trace model as [vb:93], it defines composition correctly but fails to represent some handshake behaviors. The petri nets model instead, is correct and complete with respecj to all handshake behaviors. The process calculus is in ccs style. We show its correctness as a syntax for the handshake protocol and we provide an interpretation from the calculus to the petri nets model, which is fully abstract and such that any finite net is the interpretation of some configuration in the calculus
Abu, Amsha Oula. "Application des méthodes de la comparaison stochastique pour l'analyse des disciplines fair queueing". Versailles-St Quentin en Yvelines, 1998. http://www.theses.fr/1998VERS0012.
Texto completo da fonteAmaro, Da Costa Luz Carneiro Joao Paulo. "Asynchronous event-based 3d vision". Thesis, Paris 6, 2014. http://www.theses.fr/2014PA066593/document.
Texto completo da fonteReproducing biological vision in a machine is a challenging problem for which scientists have just scratched the surface. Living organisms are able to per- form complex tasks in an awestruckly efficient manner. The stereovision is one of these complex mechanisms that computer scientists try to replicate with high resolution cameras. This thesis takes on the stereovision problem in a neuromorphic way by mean of a new generation of vision sensors also called ”silicon retinas”. These silicon retinas mimic biological retinas by cap- turing the visual information into the form of asynchronous stream of events that encode contrast change at high temporal precision. These sensors are used to study the importance of the precise timing and the scene temporal dynamics in solving the stereo correspondence problem. We propose one of the first 3D reconstruction methods which is able to produce 3Dmodelsinatrulyevent-basedandasynchronousmanner, fromevent-based visual information. Besides the novelty of proposing a truly temporal- based asynchronous event-driven approach of 3D reconstructions, this work is also able to preserve the native dynamic of the scene. Time as information medium is proven to have a critical role in stereovision. Time can supplement, compensate and even replace the usual luminance and spatial information. This work lays strong foundations for future research on high temporal and event-based dynamic stereo vision. It also opens new promisingperspectivesforsolvingtraditionalmachinevisionproblemsthanks to the use of the new asynchronous vision paradigm
Kloul, Leïla. "Méthodes d'évaluation des performances pour les réseaux ATM". Versailles-St Quentin en Yvelines, 1996. http://www.theses.fr/1996VERS0001.
Texto completo da fonteLeonard, Pierre. "Etude et expérimentation des mécanismes de synchronisation du travail collaboratif sur réseaux de postes de travail". Versailles-St Quentin en Yvelines, 1997. http://www.theses.fr/1997VERS0007.
Texto completo da fonteMehaoua, Ahmed. "Transmission de flux vidéo MPEG2 sur les services élastiques ATM". Versailles-St Quentin en Yvelines, 1997. http://www.theses.fr/1997VERS0018.
Texto completo da fonteLabiod, Houda. "Mécanismes de correction d'erreur dans un réseau ATM mobile". Versailles-St Quentin en Yvelines, 1998. http://www.theses.fr/1998VERS0013.
Texto completo da fonteGara, Slim. "Allocation dynamique des ressources pour la transmission de la vidéo sur un réseau ATM". Versailles-St Quentin en Yvelines, 1998. http://www.theses.fr/1998VERS0007.
Texto completo da fonteAgha, Khaldoun Al. "Optimisation des ressources pour réseaux mobiles à haut débit". Versailles-St Quentin en Yvelines, 1998. http://www.theses.fr/1998VERS0016.
Texto completo da fonteDu fait de l'etroite bande passante affectee au lien de transmission radio, l'optimisation de l'allocation de ressources dans les reseaux mobiles s'avere cruciale pour pouvoir y integrer le support haut debit. En effet, la diminution de la taille des cellules permet une reutilisation des ressources plus importante et demultiplie le nombre de transferts intercellulaires. Ceci implique une gestion complexe des ressources a travers les stations de base. Cette these s'est donc proposee d'etudier les schemas d'allocation existants, et d'elaborer des solutions pour les adapter aux variations de trafic, par essence, instantanees et peu previsibles dans les reseaux sans fil. Tout d'abord, l'attention s'est portee sur le schema fixe d'allocation. Partant de ce schema, a ete proposee une nouvelle methode fixe d'allocation qui permet d'equilibrer la charge du trafic, souvent non uniforme, en fonction des ressources disponibles. Cet ajustement s'est appuye sur un concept de seuil d'alarme gere par un systeme multi-agent. Les effort se sont ensuite concentres sur le schema d'allocation hybride, en particulier sur la repartition fixe et dynamique des ressources aux stations de base. Cette repartition etant invariable dans le temps, la demarche a consiste a la rendre flexible et a la faire evoluer en fonction du temps et par apprentissage. Pour ce faire, une architecture watm integrant un systeme multi-agent a ete concue, laquelle a permis de realiser un nouveau schema capable d'offrir une repartition adaptative et qui prend en consideration les conditions de trafic du reseau. Cette these s'est achevee sur la mise au point de trois schemas dynamiques issus du channel segregation. Fondes sur la communication entre les stations de base avoisinantes, ces schemas sont capables d'offrir plusieurs qualites de service a differentes classes de trafic. En effet, les agents intelligents installes dans les stations de base cooperent pour se partager les ressources avec un minimum de conflits
Bouzid, Djamila. "Gestion du trafic temps réel dans le réseau ATM". Toulouse 3, 2002. http://www.theses.fr/2002TOU30037.
Texto completo da fonteHaloua, Abderrahmane. "Étude d’un protocole de communication asynchrone faible consommation à lien radio impulsionnel ultra-large bande : implémentation sur silicium des fonctions RF critiques". Electronic Thesis or Diss., Aix-Marseille, 2018. http://www.theses.fr/2018AIXM0255.
Texto completo da fonteIn recent years, research has been devoted to the study and development of Wireless Sensor Network (WSN). These research are a response to the increase of the connected objet number in the world with development of smartphones and Internet of things (IoT). Energy consumption in sensor networks is one of the most studied areas. In fact, the optimization of the consumption of the elements making up the sensor networks allows a reduction in the costs associated with their installation, operation and maintenance. Communications in sensor networks represent an important part of their power consumption. In order to reduce the consumption of communications in sensor networks, different levels of optimization are possible. In this context, various IM2NP research projects aimed at reducing transceiver consumption through innovative design were carried out. Much of this work has been devoted to Impulsionnal Radio Ultra-Wide Band (IR-UWB). Moreover, MAC protocols used to manage the communication channel access in wireless sensor networks are also important in optimizing their consumption. The research work proposed in this manuscript, based on the work on impulse radios UWB carried out within the IM2NP, propose an optimization of the consumption of sensor networks on two levels. Firstly, an asynchronous MAC protocol based on radio wake-up radio suitable for UWB communications is proposed as well as its energy study. Following the study of the proposed asynchronous protocol, the design of a low power semi-passive wake-up receiver (WuRx) and a UWB sub-GHz impulse generator is presented and their performance in terms of energy efficiency discussed
Zein, Al Abedeen Tarif. "Intégration des liaisons par satellites dans un RNIS large bande fonctionnant en mode ATM /". Paris : École nationale supérieure des télécommunications, 1991. http://catalogue.bnf.fr/ark:/12148/cb35585871h.
Texto completo da fonteFeddaoui-Papin, Aïda. "Observateurs non linéaires pour les systèmes à mesures asynchrones : application robotique mobile". Electronic Thesis or Diss., Toulon, 2020. http://www.theses.fr/2020TOUL0008.
Texto completo da fonteThe aim of observability studies and observer design is to reconstruct the state of a dynamic system using the measurements available. In particular, the Kalman filter algorithm is considered. This widely-studied and used observer exists in several versions : for linear or nonlinear systems, for discrete, continuous or even continuous-discrete time, in the stochastic or deterministic framework. However, Most of the time, these observers are used with the assumption that the measurements provided by the sensors are synchronous. Most of the time, this assumption can be far from the physical reality, in particular when dealing with robotic systems. In this memoir, an observer tailored for nonlinear continuous-discrete asynchronous systems is presented. These systems are made of a continuous state equation and a multirate sampled output equation. Based on the existing high-gain Extended Kalman Filter for continuous nonlinear systems and continuous-discrete nonlinear systems with synchronous outputs, we develop an ad-hoc formalism and design an observer with a deterministic point of view. Its convergence is proven analytically and illustrated by an application on a mobile robotic system
Haloua, Abderrahmane. "Étude d’un protocole de communication asynchrone faible consommation à lien radio impulsionnel ultra-large bande : implémentation sur silicium des fonctions RF critiques". Thesis, Aix-Marseille, 2018. http://www.theses.fr/2018AIXM0255.
Texto completo da fonteIn recent years, research has been devoted to the study and development of Wireless Sensor Network (WSN). These research are a response to the increase of the connected objet number in the world with development of smartphones and Internet of things (IoT). Energy consumption in sensor networks is one of the most studied areas. In fact, the optimization of the consumption of the elements making up the sensor networks allows a reduction in the costs associated with their installation, operation and maintenance. Communications in sensor networks represent an important part of their power consumption. In order to reduce the consumption of communications in sensor networks, different levels of optimization are possible. In this context, various IM2NP research projects aimed at reducing transceiver consumption through innovative design were carried out. Much of this work has been devoted to Impulsionnal Radio Ultra-Wide Band (IR-UWB). Moreover, MAC protocols used to manage the communication channel access in wireless sensor networks are also important in optimizing their consumption. The research work proposed in this manuscript, based on the work on impulse radios UWB carried out within the IM2NP, propose an optimization of the consumption of sensor networks on two levels. Firstly, an asynchronous MAC protocol based on radio wake-up radio suitable for UWB communications is proposed as well as its energy study. Following the study of the proposed asynchronous protocol, the design of a low power semi-passive wake-up receiver (WuRx) and a UWB sub-GHz impulse generator is presented and their performance in terms of energy efficiency discussed
Chevrou, Florent. "Formalisation of asynchronous interactions". Phd thesis, Toulouse, INPT, 2017. http://oatao.univ-toulouse.fr/19493/1/CHEVROU_Florent.pdf.
Texto completo da fonteGlacet, Christian. "Algorithmes de routage : de la réduction des coûts de communication à la dynamique". Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00951393.
Texto completo da fonteFang, Chen Yihui. "Modélisation thermique des moteurs asynchrones en vue de la réalisation d'un outil CAO". Rouen, 1994. http://www.theses.fr/1994ROUE5077.
Texto completo da fonteOkouyi, Antsina W'Ampoumou Rodrigue. "Faisabilité d'un système basé sur le DS-CDMA pour les futurs réseaux locaux sans fil à 60 GHz". Lille 1, 2006. http://www.theses.fr/2005LIL12024.
Texto completo da fontePech, Ponia. "Incidence de la prise en compte des effets de mécanismes de lutte contre les affaiblissements (FMT) en bande Ka sur la gestion des ressources dans un système d'accès multimédia par satellite géostationnaire". École nationale supérieure de l'aéronautique et de l'espace (Toulouse ; 1972-2007), 2003. http://www.theses.fr/2003ESAE0022.
Texto completo da fonteLaplace, Rémi. "Applications et services DTN pour flotte collaborative de drones". Phd thesis, Université Sciences et Technologies - Bordeaux I, 2012. http://tel.archives-ouvertes.fr/tel-00795890.
Texto completo da fonteSouissi, Mohsen. "Mise en oeuvre du protocole IPv6 au-dessus d'une infrastructure ATM". Versailles-St Quentin en Yvelines, 2000. http://www.theses.fr/2000VERS008V.
Texto completo da fonteBertin, Yves. "Analyse des transferts de chaleur dans un moteur électrique asynchrone développement d'un environnement C.A.O. et modélisations thermoaérauliques /". Grenoble 2 : ANRT, 1987. http://catalogue.bnf.fr/ark:/12148/cb37602953x.
Texto completo da fonteBertin, Yves. "Analyse des transferts de chaleur dans un moteur électrique asynchrone : développement d'un environnement CAO et modélisations thermoaérauliques". Poitiers, 1987. http://www.theses.fr/1987POIT2283.
Texto completo da fonteMarlin, Nausica. "Communications structurées dans les réseaux". Phd thesis, Université de Nice Sophia-Antipolis, 2000. http://tel.archives-ouvertes.fr/tel-00505300.
Texto completo da fonteAl-Awa, Mohamad Nawar. "Architecture ouverte pour les applications de vision en temps réel". Grenoble INPG, 1995. http://www.theses.fr/1995INPG0136.
Texto completo da fonteGhamnia, Imène. "Rate balancing methods for multi-user MIMO systems with perfect or partial CSIT". Electronic Thesis or Diss., Sorbonne université, 2021. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2021SORUS234.pdf.
Texto completo da fonteWith the rise in smartphone usage, the system models have rapidly evolved to meet ever-growing needs for capacity in wireless networks. Indeed, there have been large advances in technology, from single-user single-antenna point-to-point communications to multi-cell multi-antenna cellular networks. In fact, multiple-input multiple-output (MIMO) technology for wireless communications is now incorporated into wireless broadband standards since 3G. Adding multiple antennas at both the transmitter and the receiver sides enables spatial multiplexing (i.e. sending multiple data streams simultaneously), which allows to increase data rates, and spatial diversity exploitation, which allows to greatly improve link quality. The multi-user MIMO downlink (so-called Broadcast Channel (BC)) has been a well investigated subject in wireless communications because of the high potential it offers in improving the system throughput. Therefore, different design criteria for multi-user MIMO communication have been investigated in the literature. Most of the downlink designs consider optimization problems w.r.t. the sum-capacity of all users. On the other hand, the major bottleneck of modern wireless communication is the interference (intracell and intercell) due to frequency reuse. Thus, in a multi-user MIMO scenario, when optimizing the overall efficiency, the power allocation is focused on the good channels, i.e., users that are subject to strong interference (e.g. cell-edge users) are neglected. The result is an unfair distribution of rate among users. In order to avoid this effect, different fairness notions have been introduced, like max-min fairness, weighted fairness, or proportional fairness. In this thesis, we focus on the weighted max-min fairness. In particular, we study the (weighted) user rate balancing problem in a multi-cell multi-user MIMO system. We address this problem by joint beamforming and power allocation optimization, aiming to satisfy the fairness requirements. In the first part, we consider perfect knowledge of the channel to solve the problem. Therein, we maximize the minimum (weighted) rate via i) weighted user Mean Square Error (MSE) uplink/downlink duality and ii) Lagrangian duality. In the second part, we consider partial knowledge of the channel. We optimize the ergodic rate balancing problem via i) weighted expected MSE by exploiting the rate – MSE relation, and ii) two approximations of the expected rate as the Expected Signal and Interference Power (ESIP) rate at the stream level and the received signal level. Furthermore, we study the transmit power minimization problem with fixed user-rate targets and provide a strategy exploiting the proposed rate balancing approaches
Trávníček, Tomáš. "Vázané modelování asynchronního motoru metodou fyzikálního modelování a metody konečných prvků". Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2017. http://www.nusl.cz/ntk/nusl-318820.
Texto completo da fonteYacoub, Aznam. "Une approche de vérification formelle et de simulation pour les systèmes à événements : application à PROMELA". Thesis, Aix-Marseille, 2016. http://www.theses.fr/2016AIXM4373/document.
Texto completo da fonteNowadays, making reliable software and systems is become harder. New technologies imply more and more interactions between complex components, whose the analysis and the understanding are become arduous.To overcome this problem, the domains of verification and validation have known a significant progress, with the emergence of new automatic methods that ensure reliability of systems. Among all these techniques, we can find two great families of tools : the formal methods and the simulation. For a long time, these two families have been considered as opposite to each other. However, recent work tries to reduce the border between them. In this context, this thesis proposes a new approach in order to integrate discrete-event simulation in formal methods. The main objective is to improve existing model-checking tools by combining them with simulation, in order to allow them detecting errors that they were not previously able to find, and especially on timed systems. This approach led us to develop a new formal language, called DEv-PROMELA. This new language, which relies on the PROMELA and on the DEVS formalism, is like both a verifiable specifications language and a simulation formalism. By combining a traditional model-checking and a discrete-event simulation on models expressed in DEv-PROMELA, it is therefore possible to detect and to understand dysfunctions which could not be found by using only a formal checking or only a simulation. This result is illustrated through the different examples which are treated in this work
Čáp, Martin. "Tepelný výpočet asynchronního motoru pomocí tepelných sítí". Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2018. http://www.nusl.cz/ntk/nusl-377097.
Texto completo da fonte