Academic literature on the topic 'Calcul de réseau'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Calcul de réseau.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Calcul de réseau"
Lellouch, Laurent. "Chromodynamique quantique sur réseau." Reflets de la physique, no. 79 (October 2024): 4–12. http://dx.doi.org/10.1051/refdp/202479004.
Full textPostadjian, Tristan, Arnaud Le Bris, Hichem Sahbi, and Clément Mallet. "Classification à très large échelle d'images satellites à très haute résolution spatiale par réseaux de neurones convolutifs." Revue Française de Photogrammétrie et de Télédétection, no. 217-218 (September 21, 2018): 73–86. http://dx.doi.org/10.52638/rfpt.2018.418.
Full textBoyer, Marc, Laurent Jouhet, and Anne Bouillard. "Notations pour le calcul réseau." Journal Européen des Systèmes Automatisés 43, no. 7-9 (November 10, 2009): 921–35. http://dx.doi.org/10.3166/jesa.43.921-935.
Full textServais, P., P. Laurent, G. Billen, and D. Gatel. "Développement d'un modèle décrivant les variations de CODB et de biomasse bactérienne dans les réseaux de distribution." Revue des sciences de l'eau 8, no. 4 (April 12, 2005): 427–62. http://dx.doi.org/10.7202/705232ar.
Full textPaquier, A., J. M. Tanguy, S. Haider, and B. Zhang. "Estimation des niveaux d'inondation pour une crue éclair en milieu urbain : comparaison de deux modèles hydrodynamiques sur la crue de Nîmes d'octobre 1988." Revue des sciences de l'eau 16, no. 1 (April 12, 2005): 79–102. http://dx.doi.org/10.7202/705499ar.
Full textVolk, C., and J. C. C. Joret. "Paramètres prédictifs de l'apparition des coliformes dans les réseaux de distribution d'eau d'alimentation." Revue des sciences de l'eau 7, no. 2 (April 12, 2005): 131–52. http://dx.doi.org/10.7202/705193ar.
Full textQuantin, M., C. Morio, G. Guibu Pereira, J. Vazquez, J. Wertel, S. Isel, S. Galuola, and J. Buche. "Calibration numérique 3D de vannes basculantes pour la mesure du débit déversé." Techniques Sciences Méthodes, no. 5 (May 2019): 89–100. http://dx.doi.org/10.1051/tsm/201905089.
Full textVazquez, J., M. François, and D. Gilbert. "Gestion en temps réel d'un réseau d'assainissement : vérification de l'optimalité et de l'applicabilité de la théorie des graphes par rapport à la programmation linéaire mixte." Revue des sciences de l'eau 16, no. 4 (April 12, 2005): 425–42. http://dx.doi.org/10.7202/705516ar.
Full textLEPELLETIER, T., H. CHIÈZE, M. BERTRAND, T. BIENVENU, M. COUET, A. LISTER, J. GEORGES, A. SAINT-GERMAIN, P. KERHERVE, and L. HASSIG. "Étude hydraulique de vulnérabilité du système d’assainissement francilien face à une crue majeure." Techniques Sciences Méthodes 12 (January 20, 2023): 105–19. http://dx.doi.org/10.36904/202212105.
Full textLe Bescond, Chloé, Fabien Thollet, Gaëlle Poulier, Stéphanie Gairoard, Hugo Lepage, Flora Branger, Luc Jamet, et al. "Des flux d'eau aux flux de matières en suspension et de contaminants associés : gestion d'un réseau de stations hydro-sédimentaires sur le Rhône." La Houille Blanche, no. 3 (June 2018): 63–70. http://dx.doi.org/10.1051/lhb/2018033.
Full textDissertations / Theses on the topic "Calcul de réseau"
Mangoua, sofack William. "Amélioration des délais de traversée pire cas des réseaux embarqués à l’aide du calcul réseau." Thesis, Toulouse, ISAE, 2014. http://www.theses.fr/2014ESAE0024/document.
Full textThe thesis addresses performance analysis of embedded real time network using network calculus. Network calculus is a theory based on min-plus algebra. We use network calculus to assess the quality of service of a residual flow in two context : aggregation with non-preemptive priority policy and DRR policy. The main contribution concerns the evaluation of residual service, given to each flow. We also present how to handle DRR and non-preemptive priority policy hierrachically
Vienne, Jérôme. "Prédiction de performances d'applications de calcul haute performance sur réseau Infiniband." Phd thesis, Grenoble, 2010. http://www.theses.fr/2010GRENM043.
Full textManufacturers of computer clusters require tools to assist them in making better decisions in terms of architectural design. To address this need, in this thesis work, we focus on the specific issues of estimating computation times and InfiniBand network congestion. These two problems are often dealt with globally. However, an overall approach does not explain the reasons of performance loss related to architectural choices. So our approach was to conduct a more detailed study. In this thesis work, we focus on the following : 1) the estimation of computation time in a Grid, and 2) the estimation of communication times over Infiniband networks. To evaluate the computation time, the proposed approach is based on a static or semi-static analysis of the source code, by cutting it into blocks, before making a micro-benchmarking of these blocks on the targeted architecture. To estimate the communication time, a model of bandwidth sharing for Infiniband networks has been developed, allowing one to predict the impact related to concurrent communications. This model was then incorporated into a simulator to be validated on a set of synthetic communication graphs and on the application Socorro
Vienne, Jérôme. "Prédiction de performances d'applications de calcul haute performance sur réseau Infiniband." Phd thesis, Université de Grenoble, 2010. http://tel.archives-ouvertes.fr/tel-00728156.
Full textDaigmorte, Hugo. "Analyse des interactions entre flux synchrones et flux asynchrones dans les réseaux temps réel." Thesis, Toulouse, ISAE, 2019. http://www.theses.fr/2019ESAE0003/document.
Full textComplex embedded systems (planes, satellites, drones ...) contain more and more calculators. From now on, these are tens or even hundreds of calculators that communicate through a shared network. A function is achieved by the collaboration of a set of devices that exchange a growing number of information. In an embedded real-time context, it must be ensured that these informations exchanged are correct but it must also be ensured that they verify their temporal constraints. From the network point of view, this means that informations must be exchanged respecting their deadlines. This implies being able to upper bound the traversal time of the network of each message in order to verify that it arrives in time. However, as embedded systems are more and more complex and as the amount of information exchanged is constantly increasing, this bound is increasingly difficult to compute. Furthermore, it is important that this upper bound to be the least pessimistic possible to avoid an oversized system.The goal of this work is to develop new methods of analysis in order to be able to compute these bounds.In order to achieve this, we used the Network Calculus method of analysis.This work focuses on the modeling of interactions between synchronous messages and asynchronous messages.The models presented in this work take into account the transmission dates on the network of synchronous messageswhen calculating the upper bounds of traversal time of the asynchronous messages.The main contributions are:1. the presentation of a new way of considering the use of the dates of emission on the CAN bus: the weak synchronization.As well as the complete modeling of such a system and finally the evaluation of the gain provided by this solution.2. a complete modeling of the TTEthernet network allowing to evaluate the impact of the synchronous flows on the traversal time of the asynchronous flows.3. a presentation of the use of synchronization in the TSN network and a complete model for analyzing this new technology
Pekergin, Mehmet Ferhan. "Optimisation combinatoire par le calcul neuronal et parallelisme optimal." Paris 5, 1992. http://www.theses.fr/1992PA05S017.
Full textLe, Potier Serge. "Optimisation stochastique distribuée : le problème de l'affectation dynamique de canal sur un réseau radio cellulaire." Rennes 1, 1999. http://www.theses.fr/1999REN1S151.
Full textBennouas, Toufik. "Modélisation de parcours du Web et calcul de communautés par émergence." Montpellier 2, 2005. http://www.theses.fr/2005MON20203.
Full textFrison, Julien. "Calcul Ab-initio de propriétés de résonances hadroniques légères." Thesis, Aix-Marseille, 2012. http://www.theses.fr/2012AIXM4082.
Full textIt has been established for now 40 years that the strong nuclear interaction can be described by Quantum Chromodynamics (QCD). However, the confinement of quarks in this theory hides its elementary degrees of freedom in low-energy processes, which have to be computed non-pertubatively. Lattice QCD is, to date, the only method allowing to go through such a computation, and is now reaching maturity. However, although the spectrum of stable hadrons is computed with precision, the study of decays is still delicate. We hereby present the application of Lüscher's formalism to the study of strong-decaying resonance properties, along with a precise computation of the decay width in the particular case of the rho meson
Lhoussaine, Cédric. "Réceptivité, mobilité et π-Calcul." Aix-Marseille 1, 2002. http://www.theses.fr/2002AIX11046.
Full textHajjar, Mansour. "Construction d'un calculateur spécialisé pour le calcul de la conductivité électrique d'un réseau de résistances aléatoires." Paris 11, 1987. http://www.theses.fr/1987PA112409.
Full textA special purpose computer for the calculation of the electric conductivity of a random resistor network. The special purpose computer PERCOLA is designed for long numerical simulations on a percolation problem in Statistical Mechanics of disordered media. Our aim is to improve the actual values of the critical exponents characterizing the behavior of random resistance networks at percolation threshold. The architecture of PERCOLA is based on an efficient iterative algorithm used to compute the electric conductivity of such networks. The calculator has the characteristics of a general purpose 64- bit floating point microprogrammable computer that can run programs for various types of problems with a peak performance of 25 Mflops. This high computing speed is a result of the pipeline architecture based on internal parallelism and separately microcode controlled units such as: data memories, a microcode memory, ALUs and multipliers (both WEITEK components), various data paths, a sequencer (ANALOG DEVICES component), address generators and a random number generator. Thus, the special purpose computer runs percolation problem program 10 percent faster than the supercomputer CRAY XMP
Books on the topic "Calcul de réseau"
Leon, Kempner, and American Society of Civil Engineers. Subcommittee on the Design of Substation Structures ., eds. Substation structure design guide: ASCE manuals and reports on engineering practice no. 113. Reston, VA: American Society of Civil Engineers, 2007.
Find full textMilner, R. Communicating and mobile systems: The [symbol for pi]-calculus. New York: Cambridge University Press, 1999.
Find full textOntario. Esquisse de cours 12e année: Fonctions avancées et introduction au calcul différentiel mcb4u cours préuniversitaire. Vanier, Ont: CFORP, 2002.
Find full textOntario. Esquisse de cours 12e année: Sciences de l'activité physique pse4u cours préuniversitaire. Vanier, Ont: CFORP, 2002.
Find full textOntario. Esquisse de cours 12e année: Technologie de l'information en affaires btx4e cours préemploi. Vanier, Ont: CFORP, 2002.
Find full textOntario. Esquisse de cours 12e année: Études informatiques ics4m cours préuniversitaire. Vanier, Ont: CFORP, 2002.
Find full textOntario. Esquisse de cours 12e année: Mathématiques de la technologie au collège mct4c cours précollégial. Vanier, Ont: CFORP, 2002.
Find full textOntario. Esquisse de cours 12e année: Sciences snc4m cours préuniversitaire. Vanier, Ont: CFORP, 2002.
Find full textOntario. Esquisse de cours 12e année: English eae4e cours préemploi. Vanier, Ont: CFORP, 2002.
Find full textOntario. Esquisse de cours 12e année: Le Canada et le monde: une analyse géographique cgw4u cours préuniversitaire. Vanier, Ont: CFORP, 2002.
Find full textBook chapters on the topic "Calcul de réseau"
"Chapitre 11 Du calcul de réseau au calcul de coeur." In Du noyau atomique au réacteur nucléaire, 93–102. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-1038-3-012.
Full text"Chapitre 11 Du calcul de réseau au calcul de coeur." In Du noyau atomique au réacteur nucléaire, 93–102. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-1038-3.c012.
Full textNEYEZHMAKOV, Pavlo, Stanislav ZUB, Sergiy LYASHKO, Irina YALOVEGA, and Nataliia LYASHKO. "Élément d’instrumentation et intergiciel de grille dans les problèmes de métrologie." In Méthodes de calcul et modélisation mathématique en cyberphysique et applications techniques 1, 351–60. ISTE Group, 2024. https://doi.org/10.51926/iste.9164.ch13.
Full textBRÜCKERHOFF-PLÜCKELMANN, Frank, Johannes FELDMANN, and Wolfram PERNICE. "Les puces photoniques." In Au-delà du CMOS, 395–422. ISTE Group, 2024. http://dx.doi.org/10.51926/iste.9127.ch9.
Full text"4. LE CALCUL DU CHEMIN LE PLUS COURT DAMS UN RÉSEAU." In Le vagabond stoïque, 139–89. Les Presses de l’Université de Montréal, 2004. http://dx.doi.org/10.1515/9782760624696-005.
Full text"Annexe 6 - Exemple de calcul du temps de relaxation spin-réseau T1 : le processus direct." In La spectroscopie de résonance paramagnétique électronique, 329–32. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-0914-1-017.
Full text"Annexe 6 - Exemple de calcul du temps de relaxation spin-réseau T1 : le processus direct." In La spectroscopie de résonance paramagnétique électronique, 329–32. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-0914-1.c017.
Full text"Calcul du résidu et applications." In Introduction à la résolution des systèmes polynomiaux, 255–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-71647-1_10.
Full textANDRÉ, Jean-Michel, and Philippe JONNARD. "Propagation dans une structure de Bragg hybride : théorie de la diffusion." In Rayonnement X et structures de Bragg artificielles, 95–116. ISTE Group, 2024. http://dx.doi.org/10.51926/iste.9187.ch4.
Full textBONNAFFOUX, Arnaud. "Inférence de réseaux de régulation de gènes à partir de données dynamiques multi-échelles." In Approches symboliques de la modélisation et de l’analyse des systèmes biologiques, 7–50. ISTE Group, 2022. http://dx.doi.org/10.51926/iste.9029.ch1.
Full textConference papers on the topic "Calcul de réseau"
Okhrimenko, Viacheslav, Iryna Shcherbak, and Yevhenii Prykhodko. "APPROCHE SYSTÉMIQUE DE L'ANALYSE DES MÉTHODES DE CALCUL DES RÉSEAUX ÉLECTRIQUES." In RICERCHE SCIENTIFICHE E METODI DELLA LORO REALIZZAZIONE: ESPERIENZA MONDIALE E REALTÀ DOMESTICHE. European Scientific Platform, 2021. http://dx.doi.org/10.36074/logos-26.11.2021.v2.09.
Full text