Literatura científica selecionada sobre o tema "Protocole des Applications à contraintes"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Protocole des Applications à contraintes".
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.
Artigos de revistas sobre o assunto "Protocole des Applications à contraintes"
LEONCE, C. "Aux frontières du réel : le patient dans tous ses états. Une typologie des différents modèles utilisés pour la simulation en santé aux États-Unis." Médecine et Armées Vol. 42 No. 2, Volume 42, Numéro 2 (1 de abril de 2014): 99–112. http://dx.doi.org/10.17184/eac.6982.
Texto completo da fonteLoire, Rémi, Hervé Piégay, Jean-René Malavoi, G. Mathias Kondolf e Gabriel Melun. "Les lâchers morphogènes depuis un barrage justification opérationnelle et protocole d'intervention". La Houille Blanche, n.º 3 (junho de 2020): 66–75. http://dx.doi.org/10.1051/lhb/2020030.
Texto completo da fonteFontagnol, Carolyn, e Catherine Mathon. "Une proposition de caractérisation de l’émotion sportive : perception des indices émotionnels dans le commentaire sportif en direct". SHS Web of Conferences 78 (2020): 09002. http://dx.doi.org/10.1051/shsconf/20207809002.
Texto completo da fonteDadda, Abdelali, Fabrice Emeriault, Christian Geindreau, Annette Esnault-Filet e Aurélie Garandet. "Amélioration des propriétés mécaniques des sols par biocimentation : étude mécanique et microstructurale". Revue Française de Géotechnique, n.º 160 (2019): 4. http://dx.doi.org/10.1051/geotech/2020008.
Texto completo da fonte-ZARADER, Cyril. "Le protocole sans-fil ZigBee/802.15.4 et ses applications". Revue de l'Electricité et de l'Electronique -, n.º 09 (2004): 78. http://dx.doi.org/10.3845/ree.2004.095.
Texto completo da fonteBLIN, Capucine, Marcos OLIVEIRA, Christel CAUSSERAND, Yannick FAYOLLE e Vincent ROCHER. "Validation d’un protocole de vieillissement accéléré de membranes fibres creuses à l’échelle semi-industrielle". TSM 12 2023, TSM 12 2023 (20 de dezembro de 2023): 179–98. http://dx.doi.org/10.36904/tsm/202312179.
Texto completo da fonteGuidez, Joël. "Nucléaire spatial : besoins, contraintes et acceptation sociétale". Revue Générale Nucléaire, n.º 1 (janeiro de 2020): 22–25. http://dx.doi.org/10.1051/rgn/20201022.
Texto completo da fonteEbanga, Nicanore Uriel. "Le régime juridique de l’emprunt communautaire de la Communauté économique et monétaire de l’Afrique centrale (CEMAC)". Gestion & Finances Publiques, n.º 3 (maio de 2023): 45–51. http://dx.doi.org/10.3166/gfp.2023.3.007.
Texto completo da fonteMillet, Pierre-Alain. "Une modélisation objet des processus industriels." Revue Française de Gestion Industrielle 14, n.º 3-4 (1 de dezembro de 1995): 27–37. http://dx.doi.org/10.53102/1995.14.03-4.242.
Texto completo da fonteGuédon-Gracia, A., H. Debéda e J. Tomas. "Les cartes d’extension PCBmod : conception et applications pédagogiques VHDL et micro-assemblage". J3eA 18 (2019): 1011. http://dx.doi.org/10.1051/j3ea/20191011.
Texto completo da fonteTeses / dissertações sobre o assunto "Protocole des Applications à contraintes"
Tfaily, Souayed Rima. "Les applications des environnements virtuels distribués à retour d'effort : contraintes et solutions sur un réseau IP". Troyes, 2005. http://www.theses.fr/2005TROY0002.
Texto completo da fonteRecently, as an increasing number of haptic devices became commercially available, more and more distributed virtual reality systems are integrated with haptic interfaces. However, there are technical difficulties in providing real-time haptic interaction in distributed virtual environments and these problems persist. Whenever virtual environments communicate via the network, unpredictable time delay and delay variation, packet loss, etc. Affects the performance of haptic interaction. Despite that many research works have been conducted to find a way of establishing multimodal interaction over networks, studies on the performance of DHVEs on IP networks have not been fully investigated and the literature on this topic is limited. In addition, Quality of Service (QoS) requirements of force feedback have not been clearly determined and solutions to deal with the network impairments are scarce. In this dissertation, I focus on determining the QoS requirements for conveying the force feedback over IP networks and for determining the upper thresholds that the haptic data should request. To do so, subjective and objective assessments have been conducted on two experimental platforms: Fast Ethernet Network and Network Impairment Emulation platforms, installed at Queen’s University of Belfast. The QoS requirements for DHVE applications cannot be satisfied in best effort service as the experiments report. Therefore, I applied differentiated Services (DiffServ) on network nodes and I determined which policies are appropriate to improve the DHVE application performance. However, DiffServ is insufficient to adapt the DHVE requirements to the dynamic network conditions; Thus, I incorporated adaptive control strategies into the haptic communication system. Control strategies are to adapt the haptic communication according to the network conditions. These techniques have been simulated on MatLab
Bouzefrane, Samia. "Etude temporelle des applications temps réel distribuées à contraintes strictes basée sur une analyse d'ordonnançabilité". Poitiers, 1998. http://www.theses.fr/1998POIT2254.
Texto completo da fonteBursuc, Sergiu. "Contraintes de déductibilité dans une algèbre quotient : réduction de modèles et applications à la sécurité". Cachan, Ecole normale supérieure, 2009. http://www.theses.fr/2009DENS0055.
Texto completo da fonteTo enable formal and automated analysis of security protocols, one has to abstract implementations of cryptographic primitives by terms in a given algebra. However, the algebra can not be free, as cryptographic primitives have algebraic properties that are either relevant to their specification or else they can be simply observed in implementations at hand. These properties are sometimes essential for the execution of the protocol, but they also open the possibility for an attack, as they give to an intruder the means to deduce new information from the messages that he intercepts over the network. In consequence, there was much work over the last few years towards enriching the Dolev-Yao model, originally based on a free algebra, with algebraic properties, modelled by equational theories. In this thesis, driven by both practical and theoretical interests, we propose general decision procedures for the insecurity of protocols, that can be applied to several classes of equational theories
Makarem, Nabil. "Performance evaluation and improvement of congestion control of the constrained application protocol for the Internet-of-things". Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS289.
Texto completo da fonteThe Constrained Application Protocol (CoAP) is a lightweight core protocol designed by the Internet Engineering Task Force (IETF) used for communication between devices in the Internet of Things (IoT). In this research work, we propose new exact mathematical models to analyze the performance of CoAP in lossy IoT networks. This study provides insights about improving CoAP congestion control in such networks and highlights the properties -- including the limitations -- of CoAP. Besides, we show that the simple control mechanism reduces significantly CoAP performance especially in terms of bandwidth utilization since it prevents the protocol from acting efficiently during congestion periods. We then propose new improvements in order to enhance the trade-off between reliability and goodput while keeping the algorithms reasonably simple for constrained devices. First, we optimize further the estimation procedure of the retransmission timeout in order to enhance congestion detection. Timeouts are the only indicator used in CoAP to detect losses, and losses are used as a strong indicator to detect congestion. Second, we replace the backoff algorithm by "real" congestion control algorithms inspired from the well-known Additive Increase Multiplicative Decrease technique and a recent measurement-based congestion control called BBR. Our analysis using both our simulator and Contiki/Cooja environment show that the rate-based approach outperforms the backoff-based approach. Moreover, all the results show that our algorithms achieve a much better tradeoff between goodput, reliability and overhead
Avanesov, Tigran. "Résolution de contraintes de déductibilité : application à la composition de services Web sécurisés". Phd thesis, Université Henri Poincaré - Nancy I, 2011. http://tel.archives-ouvertes.fr/tel-00641237.
Texto completo da fonteOlarte, Carlos. "Programmation Concurrent par Contraintes pour Vérifier un Protocole de Sécurité". Phd thesis, Ecole Polytechnique X, 2009. http://tel.archives-ouvertes.fr/tel-00430446.
Texto completo da fonteSiafa, Amine. "Protocole multipoint fiable et ordonné pour applications coopératives asynchrones". Chambéry, 1998. http://www.theses.fr/1998CHAMS024.
Texto completo da fontePeng, Shen. "Optimisation stochastique avec contraintes en probabilités et applications". Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLS153/document.
Texto completo da fonteChance constrained optimization is a natural and widely used approaches to provide profitable and reliable decisions under uncertainty. And the topics around the theory and applications of chance constrained problems are interesting and attractive. However, there are still some important issues requiring non-trivial efforts to solve. In view of this, we will systematically investigate chance constrained problems from the following perspectives. As the basis for chance constrained problems, we first review some main research results about chance constraints in three perspectives: convexity of chance constraints, reformulations and approximations for chance constraints and distributionally robust chance constraints. For stochastic geometric programs, we formulate consider a joint rectangular geometric chance constrained program. With elliptically distributed and pairwise independent assumptions for stochastic parameters, we derive a reformulation of the joint rectangular geometric chance constrained programs. As the reformulation is not convex, we propose new convex approximations based on the variable transformation together with piecewise linear approximation methods. Our numerical results show that our approximations are asymptotically tight. When the probability distributions are not known in advance or the reformulation for chance constraints is hard to obtain, bounds on chance constraints can be very useful. Therefore, we develop four upper bounds for individual and joint chance constraints with independent matrix vector rows. Based on the one-side Chebyshev inequality, Chernoff inequality, Bernstein inequality and Hoeffding inequality, we propose deterministic approximations for chance constraints. In addition, various sufficient conditions under which the aforementioned approximations are convex and tractable are derived. To reduce further computational complexity, we reformulate the approximations as tractable convex optimization problems based on piecewise linear and tangent approximations. Finally, based on randomly generated data, numerical experiments are discussed in order to identify the tight deterministic approximations. In some complex systems, the distribution of the random parameters is only known partially. To deal with the complex uncertainties in terms of the distribution and sample data, we propose a data-driven mixture distribution based uncertainty set. The data-driven mixture distribution based uncertainty set is constructed from the perspective of simultaneously estimating higher order moments. Then, with the mixture distribution based uncertainty set, we derive a reformulation of the data-driven robust chance constrained problem. As the reformulation is not a convex program, we propose new and tight convex approximations based on the piecewise linear approximation method under certain conditions. For the general case, we propose a DC approximation to derive an upper bound and a relaxed convex approximation to derive a lower bound for the optimal value of the original problem, respectively. We also establish the theoretical foundation for these approximations. Finally, simulation experiments are carried out to show that the proposed approximations are practical and efficient. We consider a stochastic n-player non-cooperative game. When the strategy set of each player contains a set of stochastic linear constraints, we model the stochastic linear constraints of each player as a joint chance constraint. For each player, we assume that the row vectors of the matrix defining the stochastic constraints are pairwise independent. Then, we formulate the chance constraints with the viewpoints of normal distribution, elliptical distribution and distributionally robustness, respectively. Under certain conditions, we show the existence of a Nash equilibrium for the stochastic game
LAUNAY-ILIADIS, MARIE-CAMILLE. "Elaboration d'un protocole optimal en pharmacocinetique clinique : applications a des anticancereux". Aix-Marseille 2, 1989. http://www.theses.fr/1989AIX22980.
Texto completo da fonteDucasse, Jean-Marie. "Randonnée pédestre et en raquettes (en moyenne montagne) : proposition d'un protocole d'étude des contraintes cardio-respiratoires en situation". Bordeaux 2, 1999. http://www.theses.fr/1999BOR2M153.
Texto completo da fonteLivros sobre o assunto "Protocole des Applications à contraintes"
Hetnarski, Richard B. Thermal stresses: Advanced theory and applications. [Dordrecht?]: Springer, 2009.
Encontre o texto completo da fonteJean-Alain, Hernandez, Joachim Bruno e Joly René (1948 ), eds. TCP/IP: Architecture, protocoles, applications. 3a ed. Paris: InterEditions, 1996.
Encontre o texto completo da fonteThe theory of constraints: Applications in quality and manufacturing. 2a ed. New York: Marcel Dekker, 1997.
Encontre o texto completo da fontePractical WAP: Developing applications for the wireless web. Cambridge: Cambridge University Press, 2001.
Encontre o texto completo da fonteAdditional Protocol to the European Agreement on the Transmission of Applications for Legal Aid =: Protocole additionnel à l'accord européen sur la transmission des demandes d'assistance judiciaire. Strasbourg: Council of Europe, 2002.
Encontre o texto completo da fonteProtocole relatif a la Commission Internationale de l'Etat Civil: Protocole additionnel au Protocole relatif a la Commission Internationale de l'Etat Civil, Berne, 25 September 1950 and Luxembourg,, 25 September 1952 : [The United Kingdom applied to accede to the Protocol on 11 March 1996. The applications was accented on 11 September 1996 and the Protocol entered into force for the United Kingdom on 11 October 1996]. London: The Stationery Office, 2001.
Encontre o texto completo da fonteERP: Tools, Techniques, and Applications for Integrating the Supply Chain, Second Edition (The St. Lucie Press Series on Resource Management). 2a ed. CRC, 2003.
Encontre o texto completo da fonteComer, Douglas E., David L. Stevens e Michael Evangelista. Internetworking with TCP/IP, Vol. III: Client-Server Programming and Applications, Linux/Posix Sockets Version. Prentice Hall, 2000.
Encontre o texto completo da fonteComer, Douglas E., David L. Stevens e Michael Evangelista. Internetworking with TCP/IP, Vol. III: Client-Server Programming and Applications, Linux/Posix Sockets Version. Prentice Hall, 2000.
Encontre o texto completo da fonteComer, Douglas E., e David L. Stevens. Internetworking with TCP/IP, Vol. III: Client-Server Programming and Applications--BSD Socket Version (2nd Edition). 2a ed. Prentice Hall, 1996.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Protocole des Applications à contraintes"
WAHL, Martine, e Patrick SONDI. "Évaluation des performances du protocole pour des applications coopératives". In Conception et évaluation de protocole de routage ad hoc, 155–211. ISTE Group, 2023. http://dx.doi.org/10.51926/iste.9112.ch4.
Texto completo da fonte"Principe du maximum de Pontriaguine, principe du maximum avec contraintes sur l’état et synthèses optimales". In Mathématiques & Applications, 153–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/3-540-37640-2_7.
Texto completo da fonteWAHL, Martine, e Patrick SONDI. "Enjeux autour des communications ad hoc sur la route". In Conception et évaluation de protocole de routage ad hoc, 5–15. ISTE Group, 2023. http://dx.doi.org/10.51926/iste.9112.ch1.
Texto completo da fonteSBAI, Ines, e Saoussen KRICHEN. "Tournées de véhicules avec contraintes de chargement : des méthodes de résolution". In Optimisation et apprentissage, 7–27. ISTE Group, 2023. http://dx.doi.org/10.51926/iste.9071.ch1.
Texto completo da fonte