Literatura académica sobre el tema "Machine-À-Machine"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Machine-À-Machine".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Machine-À-Machine"
Lisse, Michel. "Machine parlante, machine à parler, machine à écrire. Entre Schwob et Heidegger". Les Lettres Romanes 48, n.º 3-4 (agosto de 1994): 277–98. http://dx.doi.org/10.1484/j.llr.4.00898.
Texto completoLyamlahy, Khalid. "De l’Homme-machine à la machine littéraire". L'Homme & la Société 213, n.º 2 (21 de octubre de 2021): 99–117. http://dx.doi.org/10.3917/lhs.213.0099.
Texto completoCuccuru, Jean-Marc. "Machine à café". Coulisses, n.º 15 (1 de enero de 1997): 69–70. http://dx.doi.org/10.4000/coulisses.5188.
Texto completoPfauwadel, Aurélie. "Une machine à jouir". La Cause Du Désir N° 97, n.º 3 (2017): 5. http://dx.doi.org/10.3917/lcdd.097.0005.
Texto completoDagognet, Francois. "Une machine à traduire". Les cahiers de médiologie 12, n.º 2 (2001): 202. http://dx.doi.org/10.3917/cdm.012.0202.
Texto completoBirnbaum, Antonia y Olivier Nottellet. "La machine à dessiner". Multitudes 15, n.º 1 (2004): 91. http://dx.doi.org/10.3917/mult.015.0091.
Texto completoMoatti, Sandra. "La machine à dettes". Alternatives Économiques 274, n.º 11 (1 de noviembre de 2008): 48. http://dx.doi.org/10.3917/ae.274.0048.
Texto completoFajnwaks, Débora. "La machine à déscolariser". La lettre de l'enfance et de l'adolescence 67, n.º 1 (2007): 47. http://dx.doi.org/10.3917/lett.067.0047.
Texto completoGinzburg, Carlo. "Une Machine à Penser". Common Knowledge 25, n.º 1-3 (1 de abril de 2019): 285–91. http://dx.doi.org/10.1215/0961754x-7299378.
Texto completoGaullier, Xavier. "La machine à exclure". Le Débat 69, n.º 2 (1992): 156. http://dx.doi.org/10.3917/deba.069.0156.
Texto completoTesis sobre el tema "Machine-À-Machine"
Zhou, Kaijie. "Technique d'accès pour la communication machine-à-machine dans LTE/LTE-A". Thesis, Paris, ENST, 2013. http://www.theses.fr/2013ENST0076/document.
Texto completoMachine type communications is seen as a form of data communication, among devices and/or from devices to a set of servers, that do not necessarily require human interaction. However, it is challenging to accommodate MTC in LTE as a result of its specific characteristics and requirements. The aim of this thesis is to propose mechanisms and optimize the access layer techniques for MTC in LTE. For uplink access, we propose two methods to improve the performance of random access in terms of latency: a packet aggregation method and a Transmission Time Interval bundling scheme. To further reduce the uplink latency and enable massive number of connected device, we propose a new contention based access method (CBA) to bypass both the redundant signaling in the random access procedure and also the latency of regular scheduling. For downlink reception, we propose two methods to analyze the performance of discontinuous reception DRX mode for MTC applications: the first with the Poisson distribution and the second with the Pareto distribution for sporadic traffic. With the proposed models, the power saving factor and wake up latency can be accurately estimated for a given choice of DRX parameters, thus allowing to select the ones presenting the optimal tradeoff
Zhou, Kaijie. "Technique d'accès pour la communication machine-à-machine dans LTE/LTE-A". Electronic Thesis or Diss., Paris, ENST, 2013. http://www.theses.fr/2013ENST0076.
Texto completoMachine type communications is seen as a form of data communication, among devices and/or from devices to a set of servers, that do not necessarily require human interaction. However, it is challenging to accommodate MTC in LTE as a result of its specific characteristics and requirements. The aim of this thesis is to propose mechanisms and optimize the access layer techniques for MTC in LTE. For uplink access, we propose two methods to improve the performance of random access in terms of latency: a packet aggregation method and a Transmission Time Interval bundling scheme. To further reduce the uplink latency and enable massive number of connected device, we propose a new contention based access method (CBA) to bypass both the redundant signaling in the random access procedure and also the latency of regular scheduling. For downlink reception, we propose two methods to analyze the performance of discontinuous reception DRX mode for MTC applications: the first with the Poisson distribution and the second with the Pareto distribution for sporadic traffic. With the proposed models, the power saving factor and wake up latency can be accurately estimated for a given choice of DRX parameters, thus allowing to select the ones presenting the optimal tradeoff
Nguyen, Philippe. "Machine de vision à rétine intelligente". Paris 11, 1996. http://www.theses.fr/1996PA112011.
Texto completoChillet, Christian. "Machine synchrone multidisque à aimants permanents". Grenoble INPG, 1988. http://www.theses.fr/1988INPG0125.
Texto completoAudet, Réjean. "Simulation d'une sécherie de machine à papiers". Thèse, Université du Québec à Trois-Rivières, 1992. http://depot-e.uqtr.ca/5314/1/000598133.pdf.
Texto completoGharbi, Ghada. "Gestion autonomique d'objets communicants dans le cadre des réseaux machine à machine sous des contraintes temporelles". Thesis, Toulouse 3, 2016. http://www.theses.fr/2016TOU30262.
Texto completoThe decrease in communication costs, the improvement of networks performance and the evolution of the dedicated services platforms managing multiple objects, led to the appearance of new practices and applications gathered under the designation of Machine-to-Machine communications (M2M). M2M systems have to integrate in a coordinated way various devices and software modules such as sensors, actuators, displays, middleware, etc. M2M expansion gives rise to extensive data exploitation, effective routing and reasoning mechanisms for an appropriate decision making and a coordinated control in a predictive and reactive way. This work aims to meet self-management challenges characterized by recent studies of autonomic computing. It deals with the modeling and the validation of M2M systems operating in a dynamic context and under a set of functional and non-functional properties, specifically temporal ones. To do so, we propose to rely on graph grammars and model checking related techniques. This allows to configure and to reconfigure a set of communicating objects by considering a set of constraints. First, we were interested in the validation at design time of M2M communications operating under temporal constraints. A verification and validation approach based on timed automata was proposed. A smart grid scenario was developed to validate the proposed model. This step is necessary, however it is not sufficient. Indeed, M2M systems are dynamic and verification at run time is important. To validate the execution of an M2M system, we focused on in its functional and temporal aspects. We referred to the European standard smartM2M to define an architectural style for M2M systems. This standard was selected for the following reasons: (1) its independence of the application domain and the objects' communication technology, (2) its broad scope and (3) its deployment on industrial systems. To validate the M2M system' functionalities, a multi-model approach was proposed: a first model, named functional, representing a real-time view of M2M system and a second model, named formal, based on a graph grammar incorporating the concepts of the functional layer. To conduct dynamic reconfiguration actions, graph transformation rules have been defined. Bi-directional communication mechanisms have been set up to maintain coherence between the real system and its models. A smart metering use case was developed to validate the proposed approach. With the aim of validating temporal properties of an M2M system during its execution, this approach has been extended with new concepts. We have defined a three-layers based approach to describe the features and temporal properties of an M2M system: an application layer which incorporates the concepts defined in the formal layer of the previous approach with extensions to express temporal properties between applications M2M, a service layer to describe the necessary components to meet the specification of the upper layer and infrastructure layer describing their deployment. An autonomic manager interacts with these layers to supervise and control the temporal behavior of the system. These layers are part of the autonomic manager knowledge base. The autonomic manager architecture and dynamic reconfiguration mechanisms were detailed. An eHealth scenario has been designed to illustrate the proposed approach
De, Boni Rovella Gastón. "Solutions de décodage canal basées sur l'apprentissage automatique pour les communications de type machine-à-machine". Electronic Thesis or Diss., Toulouse, ISAE, 2024. http://www.theses.fr/2024ESAE0065.
Texto completoIn this Ph.D. thesis, we explore machine learning-based solutions for channel decoding in Machine-to-Machine type communications, where achieving ultra-reliable low-latency communications (URLLC) is essential. Their primary issue arises from the exponential growth in the decoder's complexity as the packet size increases. This "curse of dimensionality" manifests itself in three different aspects: i) the number of correctable noise patterns, ii) the codeword space to be explored, and iii) the number of trainable parameters in the models. To address the first limitation, we explore solutions based on a Support Vector Machine (SVM) framework and suggest a bitwise SVM approach that significantly reduces the complexity of existing SVM-based solutions. To tackle the second limitation, we investigate syndrome-based neural decoders and introduce a novel message-oriented decoder, which improves on existing schemes both in the decoder architecture and in the choice of the parity check matrix. Regarding the neural network size, we develop a recurrent version of a transformer-based decoder, which reduces the number of parameters while maintaining efficiency, compared to previous neural-based solutions. Lastly, we extend the proposed decoder to support higher-order modulations through Bit-Interleaved and generic Coded Modulations (BICM and CM, respectively), aiding its application in more realistic communication environments
Villasenor-Pineda, Luis. "Contribution à l'apprentissage dans le dialogue homme-machine". Phd thesis, Université Joseph Fourier (Grenoble), 1999. http://tel.archives-ouvertes.fr/tel-00004861.
Texto completoYelisyeyev, Andriy y Andriy Yelisyeyev. "Interface cerveau-machine à partir d'enregistrement électrique cortical". Phd thesis, Université de Grenoble, 2011. http://tel.archives-ouvertes.fr/tel-00747428.
Texto completoAilam, El Hadj. "Machine synchrone à plots supraconducteurs : Etude et réalisation". Nancy 1, 2006. http://www.theses.fr/2006NAN10050.
Texto completoWe have designed and tested an 8-pole superconducting machine. The inductor is based on the principle of flux concentration using bulk superconductor. This principle allowed a high variation of the magnetic flux induction in the air-gap of the machine. Calculations have been carried out in two steps. Firstly, the magnetic scalar potential is calculated using the Monte Carlo method. Secondly, using the regularisation method the magnetic flux density is obtained by the derivation of the magnetic scalar potential. Theoretical study of a several MW machine has been developed, it allows to compare results obtained with different kind of high and low temperature superconductors. This study shows the advantages of the BiSrCaCuO high temperature superconductor wire especially cooled to 4,2 K. The realised machine has a stationary inductor and a rotating armature. This configuration is selected to simplify the cooling system. A cryostat is designed for a sufficient test period. The tests results show the feasibility of the flux concentration principle to realise an electrical machine
Libros sobre el tema "Machine-À-Machine"
Goodkind, Terry. La machine à présages. Paris: Éditions France loisirs, 2013.
Buscar texto completo1951-, Tibo Gilles, ed. La machine à bulles. Waterloo, Québec: Éditions M. Quintin, 1994.
Buscar texto completoCôté, Denis. La machine à rajeunir. Montréal, Qué: Éditions de la courte echelle, 1991.
Buscar texto completo1957-, Gladu France, ed. Méchante machine à mystères. Markham, Ont: Editions Scholastic, 2005.
Buscar texto completo1964-, Jolin Dominique, ed. La machine à beauté: Roman. [Montréal]: Boréal, 1991.
Buscar texto completoCharlet, Nicolas. Yves Klein, machine à peindre--. Grignan: Complicités, 2003.
Buscar texto completoSoussouev, Pierre Oster. Une machine à indiquer l'univers. [Saint-Clément-de-Rivière]: Fata Morgana, 2009.
Buscar texto completoTucholsky, Kurt (1890-1935). ARMÉ D'UNE MACHINE À ÉCRIRE. Paris: Editions L'Harmattan, 2010.
Buscar texto completoCapítulos de libros sobre el tema "Machine-À-Machine"
EthnoAides, Collectif. "La démarche communautaire, une machine à produire du sens ?" En AIDES, 1984-2024, 79–106. Lyon: Presses universitaires de Lyon, 2024. http://dx.doi.org/10.4000/12rwj.
Texto completoBailly, François. "À propos de Machine to Machine". En Violence et Société. Éditions des maisons des sciences de l’homme associées, 2021. http://dx.doi.org/10.4000/books.emsha.1210.
Texto completoLusset, Élisabeth. "Machine à fessées". En Dictionnaire du fouet et de la fessée, 461–63. Presses Universitaires de France, 2022. http://dx.doi.org/10.3917/puf.poutr.2022.01.0461.
Texto completoRampazzo-Bazzan, Marco. "« Machine de guerre » ou « machine à guérilla »". En Deleuze et la violence. EuroPhilosophie Éditions, 2017. http://dx.doi.org/10.4000/books.europhilosophie.127.
Texto completoDe Montigny, Jean-Sébastien Caron y Guy Chiasson. "Une machine à exclure?" En La ville inclusive, 67–92. Les Presses de l'Université d'Ottawa, 2022. http://dx.doi.org/10.2307/j.ctv33p9zzq.8.
Texto completoMurat, Michel. "Actualité du romanesque". En La machine à histoires, 89–96. Presses universitaires du Septentrion, 2022. http://dx.doi.org/10.4000/books.septentrion.139579.
Texto completoDonnarieix, Anne-Sophie y Morgane Kieffer. "Conclusion générale. Des ressorts inoxydables". En La machine à histoires, 249–50. Presses universitaires du Septentrion, 2022. http://dx.doi.org/10.4000/books.septentrion.139714.
Texto completoTschilschke, Christian von. "Vernon Subutex et les séries télévisées". En La machine à histoires, 149–58. Presses universitaires du Septentrion, 2022. http://dx.doi.org/10.4000/books.septentrion.139639.
Texto completoJérusalem, Christine. "L’inflation romanesque de l’Histoire : deux exemples avec Emmanuel Carrère et Laurent Binet". En La machine à histoires, 183–92. Presses universitaires du Septentrion, 2022. http://dx.doi.org/10.4000/books.septentrion.139664.
Texto completoStenzel, Hartmut. "Mémoire individuelle contre mémoire collective. La construction romanesque de la guerre d’Algérie dans Des hommes de Laurent Mauvignier". En La machine à histoires, 171–82. Presses universitaires du Septentrion, 2022. http://dx.doi.org/10.4000/books.septentrion.139654.
Texto completoActas de conferencias sobre el tema "Machine-À-Machine"
Santos, Mírian Caroline Farias, Vinicius Fernandes Santos, Roseneia Rodrigues Santos de Melo y Dayana Bastos Costa. "Mapeamento de atributos utilizados em modelos de predição de acidentes na construção usando técnicas de ML". En XX ENCONTRO NACIONAL DE TECNOLOGIA DO AMBIENTE CONSTRUÍDO, 1–11. UFAL, 2024. http://dx.doi.org/10.46421/entac.v20i1.6180.
Texto completoAndraos, Mouna y Melissa Mongiat. "La machine à Turlute (the Turlute Machine)". En TEI'12: Sixth International Conference on Tangible, Embedded, and Embodied Interaction. New York, NY, USA: ACM, 2012. http://dx.doi.org/10.1145/2148131.2148198.
Texto completoŠimić, Snježana. "La photographie comme machine temporelle". En L’art, machine à voyager dans le temps. Fabula, 2017. http://dx.doi.org/10.58282/colloques.4700.
Texto completoPardoen, Mylène. "Explora’sons : la machine à remonter le temps !" En L’art, machine à voyager dans le temps. Fabula, 2017. http://dx.doi.org/10.58282/colloques.4793.
Texto completoBacharach, Jeanne. "La machine à être d’Henri Michaux". En Organicité du corps technologique (Arts, Littérature, Cinéma). Fabula, 2018. http://dx.doi.org/10.58282/colloques.5579.
Texto completoBoeglin, Noémie. "Le Monde tel qu’il sera, un roman oublié". En L’art, machine à voyager dans le temps. Fabula, 2017. http://dx.doi.org/10.58282/colloques.4725.
Texto completoSergent, Marion. "« Peinture et Temps » : la quête du mouvement chez les musicalistes". En L’art, machine à voyager dans le temps. Fabula, 2017. http://dx.doi.org/10.58282/colloques.4742.
Texto completoDziub, Nikol. "Le Sketch Book de Washington Irving, un guide du voyage dans le temps à l’usage des écrivains américains". En L’art, machine à voyager dans le temps. Fabula, 2017. http://dx.doi.org/10.58282/colloques.4790.
Texto completoMorille, Chloé. "Le récit de grotte ornée : une « hétérochronie » contemporaine". En L’art, machine à voyager dans le temps. Fabula, 2017. http://dx.doi.org/10.58282/colloques.4706.
Texto completoFraisse, Luc. "« Le seul véritable voyage, le seul bain de Jouvence » (Marcel Proust)". En L’art, machine à voyager dans le temps. Fabula, 2017. http://dx.doi.org/10.58282/colloques.4717.
Texto completoInformes sobre el tema "Machine-À-Machine"
Poussart, Denis. Le métavers : autopsie d’un fantasme Réflexion sur les limites techniques d’une réalité synthétisée, virtualisée et socialisée. Observatoire international sur les impacts sociétaux de l’intelligence artificielle et du numérique, febrero de 2024. http://dx.doi.org/10.61737/sgkp7833.
Texto completo