Academic literature on the topic 'Réseaux compacts'
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 'Réseaux compacts.'
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 "Réseaux compacts":
Rosental, Paul-André, and C. Lemercier. "Pays ruraux et découpage de l'espace : les réseaux migratoires dans la région lilloise au milieu du XIXe siècle ?" Population Vol. 55, no. 4 (April 1, 2000): 691–725. http://dx.doi.org/10.3917/popu.p2000.55n4-5.0725.
Bouchafa, Samia. "Décision cumulative pour la vision dynamique des systèmes." Revue Française de Photogrammétrie et de Télédétection, no. 202 (April 16, 2014): 2–26. http://dx.doi.org/10.52638/rfpt.2013.48.
Akrout, H. "Théorème de Voronoï dans les espaces symétriques." Canadian Journal of Mathematics 54, no. 3 (June 1, 2002): 449–67. http://dx.doi.org/10.4153/cjm-2002-015-1.
Pesce, Hubert. "Compacité de l'ensemble des réseaux isospectraux et conséquences." Topology 36, no. 3 (May 1997): 695–710. http://dx.doi.org/10.1016/s0040-9383(96)00028-6.
Dionne, Jean-Claude. "Réseaux reliques de polygones de tourbe, moyenne et basse Côte-Nord du Saint-Laurent, Québec." Géographie physique et Quaternaire 37, no. 2 (November 29, 2007): 127–46. http://dx.doi.org/10.7202/032510ar.
MUFUNGIZI, Innocent, Ruben LOOLA, Roda BONGELI, Jean KABULO, Ridi DIAKONDUA, and Hubert KAWAYA. "Contribution à l’Étude Hydro-Climatique, Morphométrique et Hydrographique du Bassin Versant de la N’djili (Sud-Ouest/R.D. Congo)." International Journal of Scientific Research and Management (IJSRM) 11, no. 10 (October 24, 2023): 262–85. http://dx.doi.org/10.18535/ijsrm/v11i10.fe01.
Sogbohossou, Médésu, and Antoine Vianou. "Unfolding through processes to compute the complete prefix of Petri nets." Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées Volume 27 - 2017 - Special... (July 24, 2017). http://dx.doi.org/10.46298/arima.3177.
Dissertations / Theses on the topic "Réseaux compacts":
Todeschini, Fabien. "Dimensionnement énergétique de réseaux de capteurs ultra-compacts autonomes en énergie." Thesis, Supélec, 2014. http://www.theses.fr/2014SUPL0008/document.
Wireless sensors have a bright future so their development is causing a lot of research.However, their autonomy is still an issue.This work focuses on this problem : find a strategy for the sensors to be autonomous.The energy required to power the sensor, whatever its working mode, must indeed be harvestedfrom the environment wherein the sensor is located. Moreover, in case of absence ora lack of available energy, the sensor has to keep working. Additionnaly the state-of-chargehas to be known in real time in order to extend the sensor lifetime. Finally, the energy managementhas to give the highest efficiency.This study led to the design and the test of a circuit in CMOS 90nm technology. Thiscircuit was integrated in wireless sensors for networks under development. Finally, a methodto estimate the level of energy in the sensor has been developed and will allow to design anew circuit of power management for wireless sensor network
Akale, Yao. "Compétitions inter-standards : modélisation des dynamiques de réseaux complexes interorganisationnels." Thesis, Lille 1, 2012. http://www.theses.fr/2012LIL12005/document.
Throughout this thesis we’ve attempted to explain standard competitions through the interorganizationalnetworks built by the protagonists. Based on the synthesis of theories derived from three main academic fields(economy of the standards and network industries, networks analysis and strategic management), the thesiselaborates proposals which make it possible to build a model network of comprehension of these competitions. Ituses a single case study, chooses a critical realistic epistemological positioning and bases itself on the empiricalsituation of competition between Blu-Ray and HD DVD technologies for the emergence of the secondgeneration standard DVD. The entire trend of the thesis is justified by a postulate of a methodological andtheoretical proximity of the interorganizational network of sponsors of a given standard and the installed base ofthat standard. This postulate made it possible to state that the interorganizational network made it possible notonly to generate the ideal installed base to win the competition, but also to impact all the others components(reliability and technical superiority, availability of complements, lock-in the consumers by the switching costs,timing of entry to the market, etc.). By mobilizing some concepts of “growth” and “resilience” of complexnetworks approaches, (Albert & Barabasi 2002, Newman, 2003a) and those of “potential power ” and “use ofpower” of authors in management (Brass & Burkhardt, 1993, Mintzberg 1983 etc.), we concluded that thesuccess in a competition between standards lies in building up a growing and resilient interorganizationalnetwork, the potential of which must actually be used on the industrial and commercial ground
Tounou, Charles. "Contribution à l’étude de systèmes à diversité d’antennes sur terminaux compacts : mesures de performances en environnement réel." Limoges, 2008. https://aurore.unilim.fr/theses/nxfile/default/0662821a-fd19-48bc-9e75-2c3ce2be923e/blobholder:0/2008LIMO4042.pdf.
Wireless communication performances are improved by using multiple antennas or multiple access systems: this is the antenna diversity principle. Diversity studies, its analysis and some measurement results are depicted in this PhD thesis. First, numerical tools that allow the calculation of diversity parameters are developed. These tools are highly efficient since they are independent of any assumption. Second, a preliminary study of the relationships between mutual coupling and diversity parameters is done. The results demonstrated that mutual coupling and correlation coefficients should be preferably low. This conclusion is used to design and optimize a compact terminal that consists of two printed monopole antennas working in the WiMax 3. 4-3. 6GHz band by a slot insertion for decoupling. Next, measurements took place in a modes stirred reverberation chamber (MSRC) using two different test-beds. The first one used a network analyzer which delivers a constant wave in the chamber. The second one is constituted by two independent digital communication modules (transmission and reception). This latest test-bed allows also measurements in indoor and indoor to outdoor environments. Finally, an analytical study proves that antenna diversity and radiation pattern synthesis are equivalent
Touhami, Abdellah. "Optimisation multi-objectif d'antennes superdirectives compactes à balayage de faisceau pour des passerelles domestiques 5G sans fil." Electronic Thesis or Diss., Université de Rennes (2023-....), 2024. http://www.theses.fr/2024URENS002.
The evolution of wireless communication impose the need for more sophisticated antenna architectures, combined with antenna diversity and beamforming techniques. This type of antenna offers new possibilities for wireless applications in terms of spectral efficiency, radio link reliability, reduced environmental impact and increased communications system capacity. However, conventional beamforming techniques often lead to a significant increase in antenna size. As a result, the integration of such systems into small wireless devices is relatively limited. Compact, superdirective antenna arrays offer an innovative and attractive solution for both beamforming needs and integration in small volumes. However, they exhibits multiple drawbacks, including low radiation efficiency, low gain and narrow bandwidth. These drawbacks limit the usefulness of superdirective arrays to meet the needs of new-generation wireless technologies. In this thesis, we propose new multi-objectives optimization methods, based on network characteristic mode theory (NCM), array factor theory as well as artificial neural networks (ANN), for the design and the development of new compact, superdirective, efficient and wideband antenna architectures for 5G applications
Debard, Alexandre. "Analyse et optimisation d'antennes réseaux compactes superdirectives." Thesis, Université Grenoble Alpes, 2020. http://www.theses.fr/2020GRALT058.
The purpose of this thesis is to study and seek improvement of the superdirective antenna array technology. This technology has been recently re-examined in the literature since it can bring some interesting functionalities in the future telecommunication applications. The examination of this type of antenna is thus conducted through the use of Spherical Wave Expansion which allows for the general study of directivity limits as well as gain limits, considering lossy antennas. The classical theory of end-fire array antennas is also reviewed, in the case of uniformly spaced tapered arrays, providing theoretical evaluation of efficiency and sensitivity to source feeding precision.Infinitesimal dipoles and Huygens sources are considered in a proposed development that links array theory and Spherical Wave Expansion. This contribution provides a formal proof for the directivity limit of Huygens-source-based end-fire arrays as well as an upper bound for the directivity of dipole-based arrays, when the inter-element spacing tends to zero. Moreover, it is shown how classical array theory can also be used to derive excitation coefficients that maximize gain rather than directivity, when loss resistances are considered. An examination over antenna size is also made to demonstrate which conditions are most favorable for the use of such supergain or superdirective end-fire array optimization.In a second part, practical implementations of superdirective antennas are surveyed, focusing on Huygens sources and compact end-fire array designs. The chosen implementation architecture of parasitic element arrays is then detailed and studied, in order to minimize the requirement for negative or positive resistive loads. This lead to the design and measurement of five prototypes that aim at achieving the maximum possible gain or directivity for a limited radiator size, with two-, three- and four-dipole end-fire arrays
Halftermeyer, Pierre. "Connexité dans les Réseaux et Schémas d’Étiquetage Compact d’Urgence." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0140/document.
We aim at assigning each vertex x of a n-vertices graph G a compact O(log n)-bit label L(x) in order to :1. construct, from the labels of the vertices of a forbidden set X C V (G), a datastructure S(X)2. decide, from S(X), L(u) and L(v), whether two vertices u and v are connected in G n X.We give a solution to this problem for the family of 3-connected graphs whith bounded genus.— We obtain O(g log n)-bit labels.— S(X) is computed in O(Sort([X]; n)) time.— Connection between vertices is decided in O(log log n) optimal time.We finally extend this result to H-minor-free graphs. This scheme requires O(polylog n)-bit labels
Dourisboure, Yon. "Routage compact et longueur arborescente." Bordeaux 1, 2003. http://www.theses.fr/2003BOR12760.
In a network, the ability to construct efficent routing schemes is crucial. Each unit, with its local knowledge of the network, has to be able to decide in which direction to forward the message. In the first part of this thesis, we construct compact routing schemes for chordal graphs and for graphs which admit tree-decomposition with small diameter bags. In this work, it appeared to us that, to construct additive streched routing schemes, it seems more judicious to consider the diameter of the bags rather than their cardinality (the tree-width), the diameter of a bag is the longest distance between two of its vertices. In this way, we introdice a new invariant fo graphs : the tree-length, with complete the notion of tree-width. In the second part, we sho tha this new parameter is useful in the construction of routing schemes, of distance labellings, and of sparse spanners. Then we compute the tree-length of any outer-planer graphs and of any grid. We show that it is not possible to minimize both length and width in a same tréé-decomposition. Finally we study two algrorithms and we propose a heuristic, all three of wich approximate the tree-length of any graph
Martin, Loïc. "Conception d’une antenne compacte de station de base pour réseaux cellulaires." Thesis, Nantes, 2017. http://www.theses.fr/2017NANT4009/document.
Cellular networks undergo majors changes in the world. Several standards have been deployed since 1980. The enthusiasm of the general public quickly saturated the first generations and the number of services increases for every standard. Development of a new one is the occasion to find new ways to simplify the radio architecture in order to relieve consumers high quality of service. Today, this radio architecture has been simplified but base station antennas have become more and more critical for their size and create problems in towns specially. Moreover, constraints from the government and consumers associations contest deployment of new base station. Works of the thesis are focused on increasing base station antenna gain based on two different technologies. Then, conception of compact radiating elements was developed and presented through a small array. Good results open new perspectives to realize a compact multiband base station antenna thanks to new compact radiating element sized in others frequency bands
Linot, Fabrice. "Apport des Surfaces à Haute Impédance à la conception d'antennes réseaux compactes et d'antennes réseaux à très large bande passante." Phd thesis, Télécom ParisTech, 2011. http://pastel.archives-ouvertes.fr/pastel-00617270.
Halnaut, Adrien. "Méthodes et outils d’analyse visuelle pour la compréhension, l’optimisation et l’élaboration de modèles de réseaux de neurones profonds." Electronic Thesis or Diss., Bordeaux, 2024. http://www.theses.fr/2024BORD0042.
Deep‐learning methods are widely used in a variety of research and industrial domains, especially in the data classification task. However, this technology is often notoriously compared to a “black box”. The user can understand input and output data of the network, but has little to no knowledge about its internal processing. This aspect of neural networks makes difficult to justify their predictions. Explainability and Interpretability of deep neural networks is a research domain merging with a variety of scientific communities. Its goal is to make easier the understanding of neural networks for both users and experts. Information visualization is one of the techniques used to answer this need. It consists in building tools which make easier the understanding and the analysis of usually high dimensional datasets, using visual abstractions and interactions. In this thesis, we make use of data extracted from the output of each layer of the neural network to interpret the model decisions using visualization methods. First, we show it is possible to visualize groups of samples processed similarly by the network using a Sankey diagram. This method asks for large data processing, which we enable by using machine clusters infrastructures used in BigData operations. In order to study more complex scenarios, involving larger datasets and heavier network architectures, we develop compact data visualization methods. We propose two approaches: the first one implies representation of data proximities using data reduction to the ℕ space, the other one implies post‐processing to ℝ�� → ℝ2 data projections to build compact grids of data. In order to evaluate the performances of these projection methods, we propose a user study protocol. Its goal is to measure the suitability of visualization methods in tasks related to the understanding of high‐dimensional data. Finally, we carry out an evaluation following this protocol to compare the efficiency between compact data visualization and scatter plot visualization. This evaluation is conducted using state of the art methods t‐SNE and Self‐Sorting Maps
Books on the topic "Réseaux compacts":
(Editor), Mohammad Ilyas, and Imad Mahgoub (Editor), eds. Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems. CRC, 2004.