Gotowa bibliografia na temat „Reconnaissance des modèles de trafic”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Reconnaissance des modèles de trafic”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Reconnaissance des modèles de trafic"
KHELIFI, Asma, Jean-Patrick LEBACQUE i Habib HAJ-SALEM. "Modélisation stochastique macroscopique d'ordre supérieur du trafic sur les réseaux routiers : implications managériales". Revue Française de Gestion Industrielle 37, nr 2 (21.09.2023): 71–86. http://dx.doi.org/10.53102/2023.37.02.1156.
Pełny tekst źródłaMaman, Catherine. "La surdité du prestataire dans la relation de service : quand le déficit de reconnaissance dégrade la satisfaction du client". Management & Sciences Sociales N° 16, nr 1 (1.01.2014): 32–46. http://dx.doi.org/10.3917/mss.016.0032.
Pełny tekst źródłaJouzel, Jean-Noël, Amélie Carrier i Arnaud Niedbalec. "Pesticides : exposition des agriculteurs, contamination et reconnaissance des maladies professionnelles". Regards croisés sur l'économie 33, nr 2 (5.12.2023): 234–43. http://dx.doi.org/10.3917/rce.033.0234.
Pełny tekst źródłaThéry, Irène. "PMA pour toutes les femmes et filiation". Esprit Janvier-Février, nr 1 (12.01.2021): 103–14. http://dx.doi.org/10.3917/espri.2013.0103.
Pełny tekst źródłaBourgeault1, Guy. "L’intervention sociale comme entreprise de normalisation et de moralisation". Nouvelles pratiques sociales 16, nr 2 (18.01.2005): 92–105. http://dx.doi.org/10.7202/009845ar.
Pełny tekst źródłaGiraud, Laurent, Soufyane Frimousse, Yves Le Bihan i Mathilde Brière. "Les effets de la compassion du Leader positif et de la justice interpersonnelle sur la reconnaissance et le bien-être des salariés". Management & Sciences Sociales N° 24, nr 1 (1.01.2018): 95–115. http://dx.doi.org/10.3917/mss.024.0095.
Pełny tekst źródłaRodrigues, Manuel J. "A Obra como Facto Comunicativo". Philosophica: International Journal for the History of Philosophy 5, nr 9 (1997): 189–205. http://dx.doi.org/10.5840/philosophica19975911.
Pełny tekst źródłaLaughlin, Charles D. "Les artefacts de la connaissance. Une perspective biogénétique structurale du symbole et de la technologie". Anthropologie et Sociétés 13, nr 2 (10.09.2003): 9–29. http://dx.doi.org/10.7202/015075ar.
Pełny tekst źródłaJames, Matt. "Recognition, Redistribution and Redress: The Case of the “Chinese Head Tax”". Canadian Journal of Political Science 37, nr 4 (grudzień 2004): 883–902. http://dx.doi.org/10.1017/s0008423904990130.
Pełny tekst źródłaPégourdie, Adrien. "Les voies sociales de la consécration musicale". Sociologie et sociétés 47, nr 2 (13.05.2016): 137–61. http://dx.doi.org/10.7202/1036343ar.
Pełny tekst źródłaRozprawy doktorskie na temat "Reconnaissance des modèles de trafic"
Oberoi, Kamaldeep Singh. "Modélisation spatio-temporelle du trafic routier en milieu urbain". Thesis, Normandie, 2019. http://www.theses.fr/2019NORMR075/document.
Pełny tekst źródłaFor past several decades, researchers have been interested in understanding traffic evolution, hence, have proposed various traffic models to identify bottleneck locations where traffic congestion occurs, to detect traffic patterns, to predict traffic states etc. Most of the existing models consider traffic as many-particle system, describe it using different scales of representation and explain its evolution quantitatively by deducing relations between traffic variables like flow, density and speed. Such models are mainly focused on computing precise information about traffic using acquired traffic data. However, computation of such precise information requires more processing resources. A way to remedy this problem is to consider traffic evolution in qualitative terms which reduces the required number of processing resources. Since traffic is spatio-temporal in nature, the models which deal with spatio-temporal phenomenon can be applied in case of traffic. Such models represent spatio-temporal phenomenon from qualitative as well as quantitative standpoints. Depending on the intended application, some models are able to differentiate between various entities taking part in the phenomenon, which proves useful in case of traffic since different objects like vehicles, buildings, pedestrians, bicycles etc., directly affecting traffic evolution, can be included in traffic models. Qualitative spatio-temporal models consider the effects of different entities on each other in terms of spatial relations between them and spatio-temporal evolution of the modeled phenomenon is described in terms of variation in such relations over time. Considering different traffic constituents and spatial relations between them leads to the formation of a structure which can be abstracted using graph, whose nodes represent individual constituents and edges represent the corresponding spatial relations. As a result, the evolution of traffic, represented using graph, is described in terms of evolution of the graph itself, i. e. change in graph structure and attributes of nodes and edges, with time. In this thesis, we propose such a graph model to represent traffic. As mentioned above, one of the applications of existing traffic models is in detecting traffic patterns. However, since such models consider traffic quantitatively, in terms of acquired traffic data, the patterns detected using such models are statistical (a term employed by Pattern Recognition researchers) in the sense that they are represented using numerical description. Since graph-based traffic model proposed in this thesis represents the structure of traffic, it can be employed to redefine the meaning of traffic patterns from statistical to structural (also a term from Pattern Recognition community). Structural traffic patterns include different traffic constituents and their inter-links and are represented using time-varying graphs. An algorithm to detect a given structural traffic pattern in the spatio-temporal graph representing traffic is proposed in this thesis. It formalizes this problem as subgraph isomorphism for time-varying graphs. In the end, the performance of the algorithm is tested using various graph parameters
Nguyen, Tuan Anh. "Dimensioning cellular IoT network using stochastic geometry and machine learning techniques". Electronic Thesis or Diss., Institut polytechnique de Paris, 2021. http://www.theses.fr/2021IPPAT014.
Pełny tekst źródłaNarrowband Internet of Things (NB-IoT) is a Low Power Wide Area technology, which was standardized in the Third Generation Partnership Project release, specifies a new random access procedure and a new transmission scheme for IoT. The advantages of the NB-IoT network are providing deep coverage, low power consumption, and support of a huge number of connections. Especially, NB-IoT can efficiently connect up to 50,000 devices per NB-IoT network cell.We focus our work on the study of NB-IoT network dimensioning. In this regard, we use stochastic geometry and machine learning techniques along with the thesis to characterize key performance indicators of the NB-IoT network, such as coverage probability, the number of required radio resource blocks, and the traffic pattern recognition and prediction based on the downlink control information. The thesis is divided into three major studies. Firstly, we derive the performance of uplink coverage probability in single-cell and multi-cell of NB-IoT network. The analytical expressions of the coverage and successful access probabilities in a single-cell NB-IoT network are presented by considering the packet arrival distribution. In the multi-cell scenario, a prediction of coverage probability is determined directly from the network parameters by using a Deep Neural Network. The subsequent analysis consists of an analytical model to calculate the required radio resource blocks in the multi-cell NB-IoT network and determine the network outage probability. This model is beneficial for operators because it clarifies how they should manage the available spectrum. Finally, the thesis addresses the recognition and prediction traffic type problems using the data collected from the Downlink Control Information. A wide group of machine learning algorithms are implemented and compared to identify the highest performances.The analysis conducted in this thesis demonstrates that stochastic geometry and machine learning techniques can serve as powerful tools to analyze the performance of the NB-IoT network. The frameworks developed in this work provide general analytical tools that can be readily extended to facilitate other research in 5G networks
Saumtally, Tibye. "Modèles bidimensionnels de trafic". Phd thesis, Université Paris-Est, 2012. http://tel.archives-ouvertes.fr/tel-00839526.
Pełny tekst źródłaAw, Abdallahi Bechir. "Modèles hyperboliques pour le trafic routier". Nice, 2001. http://www.theses.fr/2001NICE5625.
Pełny tekst źródłaHatchi, Roméo. "Analyse mathématique de modèles de trafic routier congestionné". Thesis, Paris 9, 2015. http://www.theses.fr/2015PA090048/document.
Pełny tekst źródłaThis thesis is devoted to the mathematical analysis of some models of congested road traffic. The essential notion is the Wardrop equilibrium. It continues Carlier and Santambrogio's works with coauthors. With Baillon they studied the case of two-dimensional cartesian networks that become very dense in the framework of $\Gamma$-convergence theory. Finding Wardrop equilibria is equivalent to solve convex minimisation problems.In Chapter 2 we look at what happens in the case of general networks, increasingly dense. New difficulties appear with respect to the original case of cartesian networks. To deal with these difficulties we introduce the concept of generalized curves. Structural assumptions on these sequences of discrete networks are necessary to obtain convergence. Sorts of Finsler distance are used and keep track of anisotropy of the network. We then have similar results to those in the cartesian case.In Chapter 3 we study the continuous model and in particular the limit problems. Then we find optimality conditions through a duale formulation that can be interpreted in terms of continuous Wardrop equilibria. However we work with generalized curves and we cannot directly apply Prokhorov's theorem, as in \cite{baillon2012discrete, carlier2008optimal}. To use it we consider a relaxed version of the limit problem with Young's measures. In Chapter 4 we focus on the long-term case, that is, we fix only the distributions of supply and demand. As shown in \cite{brasco2013congested} the problem of Wardrop equilibria can be reformulated in a problem à la Beckmann and reduced to solve an elliptic anisotropic and degenerated PDE. We use the augmented Lagrangian scheme presented in \cite{benamou2013augmented} to show a few numerical simulation examples. Finally Chapter 5 is devoted to studying Monge problems with as cost a Finsler distance. It leads to minimal flow problems. Discretization of these problems is equivalent to a saddle-point problem. We then solve it numerically again by an augmented Lagrangian algorithm
Sainct, Rémi. "Étude des instabilités dans les modèles de trafic". Thesis, Paris Est, 2016. http://www.theses.fr/2016PESC1067/document.
Pełny tekst źródłaHighway traffic is known to be unstable when the vehicle density becomes too high, and to create stop-and-go waves, with an alternance of free flow and congested traffic. First-order traffic models can't reproduce these oscillations, but higher-order models can, both microscopic (car-following models) and macroscopic (systems of conservation laws).This thesis analyses the representation of unstable traffic states and oscillations in various traffic models. At the microscopic level, because of the flux concavity, the average flow of these oscillations is lower than the equilibrium flow for the same density. An algorithm is given to stabilize the flow with multi-anticipation, using an intelligent autonomous vehicle.At the macroscopic level, this work introduces averaged models, using the fact that the spatio-temporal scale of the oscillations is too small to be correctly predicted by simulations. The averaged LWR model, which consists of two conservation laws, enables a macroscopic representation of the density variance in a heterogeneous traffic, and gives the correct average flow of these states. A comparison with the ARZ model, also of order 2, shows that the averaged model can reproduce a capacity drop in a more realistic way.Finally, this thesis presents the SimulaClaire project of real-time traffic prediction on the ring road of Toulouse, and its parallelized parameter optimization algorithm
Manh, Anne-Gaëlle. "Modèles déformables pour la reconnaissance d'adventices". Montpellier 2, 2001. http://www.theses.fr/2001MON20208.
Pełny tekst źródłaMastio, Matthieu. "Modèles de distribution pour la simulation de trafic multi-agent". Thesis, Paris Est, 2017. http://www.theses.fr/2017PESC1147/document.
Pełny tekst źródłaNowadays, analysis and prediction of transport network behavior are crucial elements for the implementation of territorial management policies. Computer simulation of road traffic is a powerful tool for testing management strategies before deploying them in an operational context. Simulation of city-wide traffic requires significant computing power exceeding the capacity of a single computer.This thesis studies the methods to perform large-scale multi-agent traffic simulations. We propose solutions allowing the distribution of such simulations on a large amount of computing cores.One of them distributes the agents directly on the available cores, while the second splits the environment on which the agents evolve. Graph partitioning methods are studied for this purpose, and we propose a partitioning procedure specially adapted to the multi-agent traffic simulation. A dynamic load balancing algorithm is also developed to optimize the performance of the microscopic simulation distribution.The proposed solutions have been tested on a real network representing the Paris-Saclay area.These solutions are generic and can be applied to most existing simulators.The results show that the distribution of the agents greatly improves the performance of the macroscopic simulation, whereas the environment distribution is more suited to microscopic simulation. Our load balancing algorithm also significantly improves the efficiency of the environment based distribution
Alvarez-Hamelin, José Ignacio. "Routage dans Internet : trafic autosimilaire, multicast et modèles de typologie". Paris 11, 2002. http://www.theses.fr/2002PA112267.
Pełny tekst źródłaThe first part of this thesis is dedicated to the study of the Internet topology, and a survey of the Internet models. We present a new model for Internet. This model will allows us to test unicast and multicast routing protocols. The second part is dedicated to multicast protocols. First, we presented a survey of construction technique for multicast trees. We propose two multicast protocols. MSDA protocol optimizes the total delay of multicast messages in a multicast tree. In order to quantify the optimization, we tested MSDA with the topologies obtained with our topology generator. MCT protocol builds the optimal multicast tree according to some predefined quality-of-service parameter. We performed simulations with ARPANET (1995) network topology in order to compare MCT with other classical multicast protocols. These simulations prove the positive impact of MCT for multicast communications. The last part is dedicated to the self-similar model of Internet traffic, and to a new quality-of-service parameter: the probabilistic congestion. This parameter allows the estimation of the rate of packet loss. Probabilistic congestion is adapted to a long-term description of the traffic, and it can be used for unicast routing protocols. We performed a simulation in order to validate our ideas (in the UUNET network and in the generated topologies from our topology model). These simulations prove the usefulness of probabilistic congestion for multicast protocols
Rolland, Chloé. "Modèles orientés objet pour une meilleure prédiction du trafic internet". Paris 6, 2008. http://www.theses.fr/2008PA066657.
Pełny tekst źródłaKsiążki na temat "Reconnaissance des modèles de trafic"
N, Yanushkevich Svetlana, i Nixon Mark S, red. Image pattern recognition: Synthesis and analysis in biometrics. Singapore: World Scientific, 2007.
Znajdź pełny tekst źródłaImage pattern recognition: Synthesis and analysis in biometrics. Singapore: World Scientific, 2007.
Znajdź pełny tekst źródłaGroup theoretical methods in image processing. Berlin: Springer-Verlag, 1990.
Znajdź pełny tekst źródłaPaolo, Frasconi, Smyth Padhraic i NetLibrary Inc, red. Modeling the Internet and the Web: Probabilistic methods and algorithms. Chichester, England: Wiley, 2003.
Znajdź pełny tekst źródłaField Guide to Clandestine Laboratory Identification and Investigation. London: Taylor & Francis Inc, 2004.
Znajdź pełny tekst źródłaTrip generation. Wyd. 7. Washington, D.C: Institute of Transportation Engineers, 2003.
Znajdź pełny tekst źródłaBlake, Andrew. Visual reconstruction. Cambridge, Mass: MIT, 1987.
Znajdź pełny tekst źródłaL, Commons Michael, i Symposium on Quantitative Analyses of Behavior. (8th : 1985 : Harvard University), red. Computational and clinical approaches to pattern recognition and concept formation. Hillsdale, N.J: Lawrence Erlbaum Associates, 1990.
Znajdź pełny tekst źródłaL, Commons Michael, i Symposium on Quantitative Analyses of Behavior., red. Behavioral approaches to pattern recognition and concept formation. Hillsdale, NJ: Erlbaum Associates, 1990.
Znajdź pełny tekst źródłaAvions: Histoire, modèles, technique. [Sayat]: Terres éditions, 2014.
Znajdź pełny tekst źródłaCzęści książek na temat "Reconnaissance des modèles de trafic"
GUERRASIO, Francesca. "L’expérience musicale au service de la parole". W Langues chantées / Cultures mises en musique, 57–64. Editions des archives contemporaines, 2022. http://dx.doi.org/10.17184/eac.5432.
Pełny tekst źródłaKroubo, Kafé Guy Christian, i Ouattara Bakary. "Parlers urbains et insécurité : l’exemple du nouchi dans le trafic illicite de drogues à Abidjan". W Les parlers urbains africains au prisme du plurilinguisme : description sociolinguistique, 281–303. Observatoire européen du plurilinguisme, 2020. http://dx.doi.org/10.3917/oep.kosso.2020.01.0281.
Pełny tekst źródłaStreszczenia konferencji na temat "Reconnaissance des modèles de trafic"
Guillaume, Severine, Guillaume Wisniewski, Cécile Macaire, Guillaume Jacques, Alexis Michaud, Benjamin Galliot, Maximin Coavoux, Solange Rossato, Minh-Châu Nguyên i Maxime Fily. "Les modèles pré-entraînés à l'épreuve des langues rares : expériences de reconnaissance de mots sur la langue japhug (sino-tibétain)". W XXXIVe Journées d'Études sur la Parole -- JEP 2022. ISCA: ISCA, 2022. http://dx.doi.org/10.21437/jep.2022-52.
Pełny tekst źródłaValle, Andrea. "« Mettre au monde le monde ».. Sur la relation entre sémiotique de la production et production sémiotique". W Arts du faire : production et expertise. Limoges: Université de Limoges, 2009. http://dx.doi.org/10.25965/as.3213.
Pełny tekst źródła