Littérature scientifique sur le sujet « Persistant naming »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Persistant naming ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Persistant naming"
Bidarra, Rafael, Paulos J. Nyirenda et Willem F. Bronsvoort. « A Feature-Based Solution to the Persistent Naming Problem ». Computer-Aided Design and Applications 2, no 1-4 (janvier 2005) : 517–26. http://dx.doi.org/10.1080/16864360.2005.10738401.
Texte intégralCardot, Anaïs, David Marcheix, Xavier Skapin, Agnès Arnould et Hakim Belhaouari. « Persistent Naming Based on Graph Transformation Rules to Reevaluate Parametric Specification ». Computer-Aided Design and Applications 16, no 5 (21 janvier 2019) : 985–1002. http://dx.doi.org/10.14733/cadaps.2019.985-1002.
Texte intégralNoll, Kyle, Israt Tasnim, Priscella Asman, Chandra Swamy, Katherine Connelly, Matthew Muir, Matthew Hall, Guiseppe Pellizzer, Nuri Ince et Sujit Prabhu. « NCOG-32. RELATIONSHIPS BETWEEN INTRAOPERATIVE TASK-BASED GAMMA BAND ELECTROCORTICOGRAMS, DIRECT ELECTRICAL STIMULATION, AND COGNITIVE-LINGUISTIC OUTCOME FOLLOWING AWAKE BRAIN TUMOR RESECTION ». Neuro-Oncology 26, Supplement_8 (1 novembre 2024) : viii231. http://dx.doi.org/10.1093/neuonc/noae165.0914.
Texte intégralSpielmann, Kerstin, Edith Durand, Karine Marcotte et Ana Inés Ansaldo. « Maladaptive Plasticity in Aphasia : Brain Activation Maps Underlying Verb Retrieval Errors ». Neural Plasticity 2016 (2016) : 1–11. http://dx.doi.org/10.1155/2016/4806492.
Texte intégralMitchell, David B., et Alan S. Brown. « Persistent repetition priming in picture naming and its dissociation from recognition memory. » Journal of Experimental Psychology : Learning, Memory, and Cognition 14, no 2 (1988) : 213–22. http://dx.doi.org/10.1037/0278-7393.14.2.213.
Texte intégralFarjana, Shahjadi Hisan, Soonhung Han et Duhwan Mun. « Implementation of persistent identification of topological entities based on macro-parametrics approach ». Journal of Computational Design and Engineering 3, no 2 (19 janvier 2016) : 161–77. http://dx.doi.org/10.1016/j.jcde.2016.01.001.
Texte intégralMartinovic, Jasna, Thomas Gruber et Matthias Müller. « Priming of object categorization within and across levels of specificity ». Psihologija 42, no 1 (2009) : 27–46. http://dx.doi.org/10.2298/psi0901027m.
Texte intégralWalkowiak, Justyna B., et Małgorzata Rutkiewicz-Hanczewska. « Women in the Contemporary Polish Streetscape. Memory Wars ». Acta Poloniae Historica 128 (7 février 2024) : 205–28. http://dx.doi.org/10.12775/aph.2023.128.09.
Texte intégralGürtler, Stefan, et Barbara Miller. « Branded for Survival : Naming Effects on the Life Expectancy of New Companies ». Marketing ZFP 44, no 2 (2022) : 44–62. http://dx.doi.org/10.15358/0344-1369-2022-2-44.
Texte intégralDavis, Tyler B. « Liberating Discernment : Language, Concreteness, and Naming Divine Activity in History ». Religions 10, no 10 (30 septembre 2019) : 562. http://dx.doi.org/10.3390/rel10100562.
Texte intégralThèses sur le sujet "Persistant naming"
Cardot, Anaïs. « Rejeu basé sur des règles de transformation de graphes ». Thesis, Poitiers, 2019. http://www.theses.fr/2019POIT2254.
Texte intégralIn many modelling fields, such as architecture, archaeology or CAD, performing many variations of the same model is an expanding need. But building all those variations manually takes time. It is therefore needed to use automatic technics to revaluate some parts of a model, or even an entire model, after the user specifies the modifications. Most of the existing approaches dedicated to revaluating models are based on a system called parametric modelling. It is made of two parts, a geometric model and a parametric specification, which allows to record the series of operation that created the model, and the different parameters of those operations. This way, the user can change some parameters, or edit the list of operations to modify the model. To do so, we use a system called persistent naming, introduced during the 90ies, that allows us to identify and match the entities of an initial specification and the ones of a revaluated specification. In this thesis, our goal is to propose a persistent naming system that would be general, homogeneous and that would allow the user to edit a parametric specification (which means move, add, or delete some operations). We base our system on the Jerboa library, which uses graph transformation rules. This way, we will be able to use those rules to create our naming system, while also linking the notions of graph transformation rules and parametric specification. We will then describe how to use our naming method to revaluate or edit parametric specifications. Finally, we will compare our method with the other ones from the literature
Gaide, Maxime. « Modélisation et rejeu basés sur des règles ». Electronic Thesis or Diss., Chasseneuil-du-Poitou, Ecole nationale supérieure de mécanique et d'aérotechnique, 2024. http://www.theses.fr/2024ESMA0026.
Texte intégralDesigning a complex object is a tedious process involving repeated cycles of trial and error. In order to alleviate such a difficulty in the designing process, current parametric modelling systems offer some reevaluation mechanism sallowing a user to rebuild an object based on the editing of its parameters. However, such a process requires either processing an entire mesh in order to detect topological changes, which is computationally expensive, or hard-coding the changes in the modelling operations, which is computationally efficient but increases the risks to introduce detection errors. To address these limitations, our works focus on the development of a rule-based modelling system dedicated to the reevaluation of modelling processes. In particular, this system allows the addition, deletion and reordering of the operations defining those processes. We consider operations formalised with Jerboa’s graph transformation rules. Our first contribution is the syntactic analysis of the operations allowing for the detection of topological changes (creation, split, merge, and so on). These analyses are statically performed on rules, independently of the object onto which they are being applied. Thus, topological changes can be automatically detected and tracked. In some defined cases, a localised analysis performed within the object can assert whether the event has occurred or not. Our second contribution makes use of our topological changes detection approach in order to offer a reevaluation mechanism. Considering that a modelling process is a record of operations sequentially applied on specific topological entities, reevaluating a modelling process first requires solving the long-standing problem of persistently naming topological entities in a geometric model. To achieve this goal, we offer to reconstitute the histories of topological entities referenced within a modelling process. Each entity can be identified through its history, which is unique. With this mechanism, we reference topological entities in a robust way throughout reevaluation. Our third contribution aims to extend our reevaluation mechanism to include scripts of rules which can be used to create more complex operations. The Jerboa script language makes it possible to create such scripts with usual control structures such as alternatives and iterations. We extend our reevaluation mechanism by including these control structures, hence, enabling the user with greater versatility in modelling and managing complex operations
Cardot, Anais. « Rejeu basé sur des règles de transformation de graphes ». Thesis, 2019. http://www.theses.fr/2019POIT2254/document.
Texte intégralIn many modelling fields, such as architecture, archaeology or CAD, performing many variations of the same model is an expanding need. But building all those variations manually takes time. It is therefore needed to use automatic technics to revaluate some parts of a model, or even an entire model, after the user specifies the modifications. Most of the existing approaches dedicated to revaluating models are based on a system called parametric modelling. It is made of two parts, a geometric model and a parametric specification, which allows to record the series of operation that created the model, and the different parameters of those operations. This way, the user can change some parameters, or edit the list of operations to modify the model. To do so, we use a system called persistent naming, introduced during the 90ies, that allows us to identify and match the entities of an initial specification and the ones of a revaluated specification. In this thesis, our goal is to propose a persistent naming system that would be general, homogeneous and that would allow the user to edit a parametric specification (which means move, add, or delete some operations). We base our system on the Jerboa library, which uses graph transformation rules. This way, we will be able to use those rules to create our naming system, while also linking the notions of graph transformation rules and parametric specification. We will then describe how to use our naming method to revaluate or edit parametric specifications. Finally, we will compare our method with the other ones from the literature
Livres sur le sujet "Persistant naming"
Kende, Mathias. Introduction. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198817611.003.0001.
Texte intégralChapitres de livres sur le sujet "Persistant naming"
Herfert, Michael, et Andreas Berger. « Persistente digitale Identitäten ohne globale Namen ». Dans Systemsicherheit, 227–42. Wiesbaden : Vieweg+Teubner Verlag, 2000. http://dx.doi.org/10.1007/978-3-322-84957-1_18.
Texte intégralSnowling, Margaret J. « 7. The three Cs ». Dans Dyslexia : A Very Short Introduction, 120–30. Oxford University Press, 2019. http://dx.doi.org/10.1093/actrade/9780198818304.003.0007.
Texte intégralGrosjean, Hélène, et Christophe Nihan. « Entre espace et puissance : le séjour des morts et la persistance de structures polythéistes dans la Bible hébraïque ». Dans Naming and Mapping the Gods in the Ancient Mediterranean, 407–30. De Gruyter, 2022. http://dx.doi.org/10.1515/9783110798432-022.
Texte intégralKong, Lingda, et Xiaoming Jiang. « Perspective Chapter : How can Psycholinguistic Researches Respond To Societal Needs ». Dans Psycholinguistics - New Advances and Real World Applications [Working Title]. IntechOpen, 2024. http://dx.doi.org/10.5772/intechopen.1004347.
Texte intégralKinch, Michael. « Trials and Tribulations ». Dans Prescription for Change. University of North Carolina Press, 2016. http://dx.doi.org/10.5149/northcarolina/9781469630625.003.0003.
Texte intégralActes de conférences sur le sujet "Persistant naming"
Gaide, Maxime, David Marcheix, Agnès Arnould, Xavier Skapin, Hakim Belhaouari et Stéphane Jean. « Reevaluation in Rule-Based Graph Transformation Modeling Systems ». Dans Computer Science Research Notes. University of West Bohemia, Czech Republic, 2024. http://dx.doi.org/10.24132/csrn.3401.13.
Texte intégralBari, Md Faizul, Md Rakibul Haque, Reaz Ahmed, Raouf Boutaba et Bertrand Mathieu. « Persistent naming for P2P Web hosting ». Dans 2011 IEEE International Conference on Peer-to-Peer Computing (P2P). IEEE, 2011. http://dx.doi.org/10.1109/p2p.2011.6038745.
Texte intégralMarcheix, David, et Guy Pierra. « A survey of the persistent naming problem ». Dans the seventh ACM symposium. New York, New York, USA : ACM Press, 2002. http://dx.doi.org/10.1145/566282.566288.
Texte intégralDavid, Marcheix, Cardot Anaïs, Skapin Xavier et Dieudonné-Glad Nadine. « A Persistent Naming System Based on Graph Transformation Rules ». Dans 26. International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision'2017. Západočeská univerzita, 2018. http://dx.doi.org/10.24132/csrn.2018.2803.7.
Texte intégralKajtazovic, Nermin, Christopher Preschern et Christian Kreiner. « A Persistent Naming Scheme for Embedded Systems in Automation ». Dans 2013 20th IEEE International Conference and Workshops on Engineering of Computer Based Systems (ECBS). IEEE, 2013. http://dx.doi.org/10.1109/ecbs.2013.18.
Texte intégralDai, Fusheng, et Wei Zhao. « A Persistent Naming Discrimination Method Based on the Sweeping Direction ». Dans 2024 4th International Conference on Consumer Electronics and Computer Engineering (ICCECE). IEEE, 2024. http://dx.doi.org/10.1109/iccece61317.2024.10504159.
Texte intégralCardot, Anaïs, David Marcheix et Xavier Skapin. « Persistent Naming Based on Graph Transformation Rules to Reevaluate Parametric Specification ». Dans CAD'18. CAD Solutions LLC, 2018. http://dx.doi.org/10.14733/cadconfp.2018.387-391.
Texte intégralYe, Peng, Yonggang Zhang, Yanglan Wang, Geying Huang et Lianshui Guo. « A Method of Parametric Model Data Exchange and Reconstruction Based on Feature Script ». Dans ASME 2021 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/imece2021-69067.
Texte intégral