Littérature scientifique sur le sujet « Worm Algorithm »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
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 « Worm Algorithm ».
À 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 "Worm Algorithm"
Rindlisbacher, Tobias, et Philippe de Forcrand. « Worm algorithm for theCPN−1model ». Nuclear Physics B 918 (mai 2017) : 178–219. http://dx.doi.org/10.1016/j.nuclphysb.2017.02.021.
Texte intégralGaofei, Zheng, Wang Xiufeng et Zhang Yanli. « The self-organizing worm algorithm ». Journal of Systems Engineering and Electronics 18, no 3 (septembre 2007) : 650–54. http://dx.doi.org/10.1016/s1004-4132(07)60143-1.
Texte intégralDelgado, Y., et A. Schmidt. « Worm Algorithm for Abelian Gauge-Higgs Models ». Acta Physica Polonica B Proceedings Supplement 6, no 3 (2013) : 911. http://dx.doi.org/10.5506/aphyspolbsupp.6.911.
Texte intégralProkof'ev, N. V., B. V. Svistunov et I. S. Tupitsyn. « “Worm” algorithm in quantum Monte Carlo simulations ». Physics Letters A 238, no 4-5 (février 1998) : 253–57. http://dx.doi.org/10.1016/s0375-9601(97)00957-2.
Texte intégralKerl, John. « A worm algorithm for random spatial permutations ». Physics Procedia 4 (2010) : 61–65. http://dx.doi.org/10.1016/j.phpro.2010.08.009.
Texte intégralJanke, Wolfhard, Thomas Neuhaus et Adriaan M. J. Schakel. « Critical loop gases and the worm algorithm ». Nuclear Physics B 829, no 3 (avril 2010) : 573–99. http://dx.doi.org/10.1016/j.nuclphysb.2009.12.024.
Texte intégralYang, XinYu, Yi Shi et HuiJun Zhu. « Detection and location algorithm against local-worm ». Science in China Series F : Information Sciences 51, no 12 (27 août 2008) : 1935–46. http://dx.doi.org/10.1007/s11432-008-0132-z.
Texte intégralSalunkhe, Shamal, et Surendra Bhosale. « Nature Inspired Algorithm for Pixel Location Optimization in Video Steganography Using Deep RNN ». International Journal on Engineering, Science and Technology 3, no 2 (16 janvier 2022) : 146–54. http://dx.doi.org/10.46328/ijonest.67.
Texte intégralWang, Yifan, Prathamesh Pandit, Akhil Kandhari, Zehao Liu et Kathryn A. Daltorio. « Rapidly Exploring Random Tree Algorithm-Based Path Planning for Worm-Like Robot ». Biomimetics 5, no 2 (5 juin 2020) : 26. http://dx.doi.org/10.3390/biomimetics5020026.
Texte intégralHilool, Ali Khalid, Soukaena H. Hashem et Shatha H. Jafer. « Intrusion detection system based on bagging with support vector machine ». Indonesian Journal of Electrical Engineering and Computer Science 24, no 2 (1 novembre 2021) : 1100. http://dx.doi.org/10.11591/ijeecs.v24.i2.pp1100-1106.
Texte intégralThèses sur le sujet "Worm Algorithm"
SILVA, Antônio Márcio Pereira. « Estudos sobre o modelo O(N) na rede quadrada e dinâmica de bolhas na célula de Hele-Shaw ». Universidade Federal de Pernambuco, 2013. https://repositorio.ufpe.br/handle/123456789/17187.
Texte intégralMade available in DSpace on 2016-06-29T13:52:59Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) tese_final.pdf: 5635071 bytes, checksum: b300efb627e9ece412ad5936ab67e8e2 (MD5) Previous issue date: 2013-08-26
CNPq
No presente trabalho duas classes de problemas são abordadas. Primeiramente, são apresentados estudos computacionais sobre o modelo O(n) de spins na rede quadrada, e em seguida apresentamos novas soluções exatas para a dinâmica de bolhas na célula de Hele-Shaw. O estudo do modelo O(n) é feito utilizando sua representação em laços (cadeias fechadas), a qual é obtida a partir de uma expansão para altas temperaturas. Nesse representação, a função de partição do modelo possui uma expansão diagramática em que cada termo depende do número e comprimento total de laços e do número de (auto)interseções entre esses laços. Propriedades críticas do modelo de laços O(n) são obtidas através de conceitos oriundos da teoria de percolação. Para executar as simulações Monte Carlo, usamos o eficiente algoritmo WORM, o qual realiza atualizações locais através do movimento da extremidade de uma cadeia aberta denominada de verme e não sofre com o problema de "critical slowing down". Para implementar esse algoritmo de forma eficiente para o modelo O(n) na rede quadrada, fazemos uso de um nova estrutura de dados conhecida como listas satélites. Apresentamos estimativas para o ponto crítico do modelo para vários valores de n no intervalo de 0 < n ≤ 2. Usamos as estatísticas de laços e vermes para extrair, respectivamente, os expoentes críticos térmicos e magnéticos do modelo. No estudo de dinâmica de interfaces, apresentamos uma solução exata bastante geral para um arranjo periódico de bolhas movendo-se com velocidade constante ao longo de uma célula de Hele-Shaw. Usando a periodicidade da solução, o domínio relevante do problema pode ser reduzido a uma célula unitária que contém uma única bolha. Nenhuma imposição de simetria sobre forma da bolha é feita, de modo que a solução é capaz de produzir bolhas completamente assimétricas. Nossa solução é obtida por métodos de transformações conformes entre domínios duplamente conexos, onde utilizamos a transformação de Schwarz-Christoffel generalizada para essa classe de domínios.
In this thesis two classes of problems are discussed. First, we present computational studies of the O(n) spin model on the square lattice and determine its critical properties, whereas in the second part of the thesis we present new exact solutions for bubble dynamics in a Hele-Shaw cell. The O(n) model is investigated by using its loop representation which is obtained from a high-temperature expansion of the original model. In this representation, the partition function admits an diagrammatic expansion in which each term depends on the number and total length of loops (closed graphs) as well as on the number of intersections between these loops. Critical properties of the O(n) model are obtained by employing concepts from percolation theory. To perform Monte Carlo simulations of the model, we use the WORM algorithm, which is an efficient algorithm that performs local updates through the motion of one of the ends (called head) of an open chain (called worm) and hence does not suffer from “critical slowing down”. To implement this algorithm efficiently for the O(n) model on the square lattice, we make use of a new data structure known as a satellite list. We present estimates for the critical point of the model for various values of n in the range 0 < n ≤ 2. We use the statistics about the loops and the worm to extract the thermal and magnetic critical exponents of the model, respectively. In our study about interface dynamics, we present a rather general exact solution for a periodic array of bubbles moving with constant velocity in a Hele-Shaw cell. Using the periodicity of the solution, the relevant domain of the problem can be reduced to a unit cell containing a single bubble. No symmetry requirement is imposed on the bubble shape, so that the solution is capable of generating completely asymmetrical bubbles. Our solution is obtained by using conformal mappings between doubly-connected domains and employing the generalized Schwarz-Christoffel formula for this class of domains.
Meier, Hannes. « Phase transitions in novel superfluids and systems with correlated disorder ». Doctoral thesis, KTH, Statistisk fysik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-160929.
Texte intégralQC 20150306
Saccani, Sebastiano. « Quantum Monte Carlo studies of soft Bosonic systems and Minimum Energy Pathways ». Doctoral thesis, SISSA, 2013. http://hdl.handle.net/20.500.11767/4931.
Texte intégralOhlsson, Patrik. « Computer Assisted Music Creation : A recollection of my work and thoughts on heuristic algorithms, aesthetics, and technology ». Thesis, Kungl. Musikhögskolan, Institutionen för komposition, dirigering och musikteori, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kmh:diva-2090.
Texte intégralStadtherr, Hans. « Work efficient parallel scheduling algorithms ». [S.l. : s.n.], 1998. http://deposit.ddb.de/cgi-bin/dokserv?idn=962681369.
Texte intégralThakkar, Darshan Suresh, et darshanst@gmail com. « FPGA Implementation of Short Word-Length Algorithms ». RMIT University. Electrical and Computer Engineering, 2008. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080806.140908.
Texte intégralCECCHINI, FLAVIO MASSIMILIANO. « Graph-based Clustering Algorithms for Word Sense Induction ». Doctoral thesis, Università degli Studi di Milano-Bicocca, 2017. http://hdl.handle.net/10281/151635.
Texte intégralThis dissertation is about Word Sense Induction (WSI), a branch of Natural Language Processing concerned with the automated, unsupervised detection and listing of the possible senses that a word can assume relative to the different contexts in which it appears. To this end, no external resources like dictionaries or ontologies are used. Among the many existing approaches to WSI, we focus specifically on modelling the context of a word through a graph and on running a clustering algorithm on it: the resulting clusters are interpreted as implicitly describing the possible senses of the word. Fundamental notions of WSI, basic concepts and some WSI approaches selected from literature are presented and examined in the first part of this work. In the second part, we introduce our threefold contribution. Firstly, we define and explore a weighted (together with an unweighted) Jaccard distance, i.e. a distance on the nodes of a positively weighted undirected graph which we use to obtain second-order relations from the first-order ones modelled by the graph (e.g. co-occurrences). Moreover, we define the related notion of gangplank edge, a separator edge with weight greater than the mean weights of the edges incident to either of its two ends, and finally a new synthetic interpretation of the curvature on a graph, seen as the difference between weighted and unweighted Jaccard distances between node couples. Our Jaccard distance is at the basis of the second contribution: three novel graph-based clustering algorithms expressly created for the task of WSI, respectively the gangplank clustering algorithm, an aggregative clustering algorithm and a curvature-based clustering algorithm. The third contribution is a novel evaluation framework for graph-based clustering algorithms for WSI, consisting of two word graph data sets (one for co-occurrences and one for semantic similarities) and a new ad hoc evaluation measure built around pseudowords. A pseudoword is the artificial conflation of two existing words, used as an ambiguous word whose (pseudo)senses are perfectly known. This enables to evaluate WSI algorithms on an easily creatable and expandable data set. We carry out a pseudoword-based evaluation for a number of graph-based clustering algorithms, including our three proposed systems. The investigation of how the parameters of a pseudoword affect an algorithm's outcomes, the comparison of the scores obtained by different evaluation metrics together with the detection of their biases, the size of the clusterings and the trends put in evidence by the hyperclustering step, the influence of the type of a word graph (based on semantic similarities or co-occurrences) on the output of an algorithm - all these factors, preceded by the comprehensive description of the task and the definition of novel concepts and instruments to tackle it, concur to give a deeper insight into the functioning and pitfalls of graph-based Word Sense Induction. We highlight and isolate the elements that determine how the results of an algorithm look like, discuss their properties and behaviours in relation to the word graph features and establish the pro and contra of each algorithm. Our analysis provides an experimental compass that helps pinpoint the right characteristics required by a clustering algorithm for the task of Word Sense Induction, and that helps orient the construction of a word graph. In particular, we have put in evidence the different syntagmatic versus paradigmatic contrast inherent to word graphs based on co-occurrences and semantic similarities.
Costa, Karine Piacentini Coelho da. « Estudo do modelo de Bose-Hubbard usando o algoritmo Worm ». Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/43/43134/tde-27022012-085711/.
Texte intégralThis work study the two-dimensional ultracold bosonic atoms loaded in a square optical lattice, without harmonic confinement. The dynamics of this system is described by the Bose-Hubbard model, which predicts a quantum phase transition from a superfluid to a Mott-insulator at low temperatures that can be induced by varying the depth of the optical potential. We present here the phase diagram of this transition built from a mean field approach and from a numerical calculation using a Quantum Monte Carlo algorithm, namely the Worm algorithm. We found the critical transition point for the first Mott lobe in both cases, in agreement with the standard literature.
Embretsén, Stefan. « Modifying a pure pursuit algorithm to work in three dimensions ». Thesis, Umeå universitet, Institutionen för datavetenskap, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-142508.
Texte intégralChen, Wen-Tsong. « Word level training of handwritten word recognition systems / ». free to MU campus, to others for purchase, 2000. http://wwwlib.umi.com/cr/mo/fullcit?p9974612.
Texte intégralLivres sur le sujet "Worm Algorithm"
Eneko, Agirre, et Edmonds Philip Glenny, dir. Word sense disambiguation : Algorithms and applications. [New York] : Springer, 2007.
Trouver le texte intégral1948-, Apostolico Alberto, Galil Zvi et North Atlantic Treaty Organization. Scientific Affairs Division., dir. Combinatorial algorithms on words. Berlin : Springer-Verlag, 1985.
Trouver le texte intégralRosenberg, Jonathan B. How Debuggers work : Algorithms, data structures, and architecture. New York : John Wiley, 1996.
Trouver le texte intégralSachs, Sarah Elizabeth. The Algorithm at Work : The Reconfiguration of Work and Expertise in the Making of Similarity in Art Data. [New York, N.Y.?] : [publisher not identified], 2019.
Trouver le texte intégralPotts, Christopher Nigel. Approximation algorithms for schedeling a single machine to minimize total late work. Fontainebleau : INSEAD, 1991.
Trouver le texte intégralCloughley, William R. Evaluation of work distribution algorithms and hardware topologies in a multi-Transputer network. Monterey, California : Naval Postgraduate School, 1988.
Trouver le texte intégralSpeed arithmetic : Based on Vedic word-formulas. 3e éd. Chennai : Vijaya Ramasubban, 2008.
Trouver le texte intégralXie, Shane. Rapid One-of-a-kind Product Development : Strategies, Algorithms and Tools. London : Springer-Verlag London, 2011.
Trouver le texte intégralHughes, Roland. The Minimum You Need to Know about Logic to Work in It. USA : Logikal Solutions, 2007.
Trouver le texte intégralMundel, Marvin Everett. The white-collar knowledge worker : Measuring and improving productivity and effectiveness : algorithms and PC programs. [Tokyo, Japan] : Asian Productivity Organization, 1989.
Trouver le texte intégralChapitres de livres sur le sujet "Worm Algorithm"
Brabazon, Anthony, et Seán McGarraghy. « Worm Foraging Algorithm ». Dans Natural Computing Series, 253–62. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-59156-8_13.
Texte intégralProkof’ev, Nikolay. « Diagrammatic Monte Carlo and Worm Algorithm Techniques ». Dans Springer Series in Solid-State Sciences, 273–92. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35106-8_10.
Texte intégralLim, Donghyun, Jinwook Chung et Seongjin Ahn. « Using Genetic Algorithm for Network Status Learning and Worm Virus Detection Scheme ». Dans Intelligent Data Engineering and Automated Learning – IDEAL 2006, 444–53. Berlin, Heidelberg : Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11875581_54.
Texte intégralGonzalez-Gomez, J., I. Gonzalez, F. Gomez-Arribas et E. Boemo. « Evaluation of a Locomotion Algorithm for Worm-Like Robots on FPGA-Embedded Processors ». Dans Reconfigurable Computing : Architectures and Applications, 24–29. Berlin, Heidelberg : Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11802839_4.
Texte intégralKim, Jungwon, William O. Wilson, Uwe Aickelin et Julie McLeod. « Cooperative Automated Worm Response and Detection ImmuNe ALgorithm(CARDINAL) Inspired by T-Cell Immunity and Tolerance ». Dans Lecture Notes in Computer Science, 168–81. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11536444_13.
Texte intégralBansal, Jagdish Chand, Prathu Bajpai, Anjali Rawat et Atulya K. Nagar. « Conclusion and Further Research Directions ». Dans Sine Cosine Algorithm for Optimization, 105–6. Singapore : Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-9722-8_6.
Texte intégralMalitsky, Yuri. « Related Work ». Dans Instance-Specific Algorithm Configuration, 7–14. Cham : Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11230-5_2.
Texte intégralGuan, Ji, Wang Fang et Mingsheng Ying. « Robustness Verification of Quantum Classifiers ». Dans Computer Aided Verification, 151–74. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_7.
Texte intégralJarrahi, Mohammad Hossein, et Will Sutherland. « Algorithmic Management and Algorithmic Competencies : Understanding and Appropriating Algorithms in Gig Work ». Dans Information in Contemporary Society, 578–89. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-15742-5_55.
Texte intégralBarth, Lukas, Stephen G. Kobourov et Sergey Pupyrev. « Experimental Comparison of Semantic Word Clouds ». Dans Experimental Algorithms, 247–58. Cham : Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07959-2_21.
Texte intégralActes de conférences sur le sujet "Worm Algorithm"
Khan, Aarfa, Shweta Shrivastava et Vineet Richariya. « Normalized Worm-hole Local Intrusion Detection Algorithm(NWLIDA) ». Dans 2014 International Conference on Computer Communication and Informatics (ICCCI). IEEE, 2014. http://dx.doi.org/10.1109/iccci.2014.6921748.
Texte intégralWei Wang, Yingying Wang, Jinghao Qi, Houxiang Zhang et Jianwei Zhang. « The CPG control algorithm for a climbing worm robot ». Dans 2008 3rd IEEE Conference on Industrial Electronics and Applications (ICIEA). IEEE, 2008. http://dx.doi.org/10.1109/iciea.2008.4582600.
Texte intégralZhang, Jie, Min-fang Peng, Liang Zhu, Hong-wei Che et Jing-ying Hou. « Distribution Network Vulnerability Analysis Based on the Worm Algorithm ». Dans 2016 International Conference on Electrical Engineering and Automation (EEA2016). WORLD SCIENTIFIC, 2017. http://dx.doi.org/10.1142/9789813220362_0054.
Texte intégralMaillart, Vidushi, et Urs Wenger. « Worm algorithm for the O(2N) Gross-Neveu model ». Dans The XXVIII International Symposium on Lattice Field Theory. Trieste, Italy : Sissa Medialab, 2011. http://dx.doi.org/10.22323/1.105.0257.
Texte intégralXiao, Fengtao, Huaping Hu, Bo Liu et Xin Chen. « PTBBWD : A Fast Process Traffic Behavior Based Worm Detection Algorithm ». Dans 2008 International Seminar on Future Information Technology and Management Engineering. IEEE, 2008. http://dx.doi.org/10.1109/fitme.2008.150.
Texte intégralGessner, Andrzej. « Theoretical Basis of Generation of Face Worm Gear Drive With Duplex Worm ». Dans ASME 8th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2006. http://dx.doi.org/10.1115/esda2006-95519.
Texte intégralXue, Li, et Zhihui Hu. « Research of Worm Intrusion Detection Algorithm Based on Statistical Classification Technology ». Dans 2015 8th International Symposium on Computational Intelligence and Design (ISCID). IEEE, 2015. http://dx.doi.org/10.1109/iscid.2015.215.
Texte intégralKang, Donghwa, Seoyeon Kim, Jinman Jung, Bongjae Kim, Hong Min et Junyoung Heo. « Genetic algorithm based patching scheme for worm containment on social network ». Dans SAC 2017 : Symposium on Applied Computing. New York, NY, USA : ACM, 2017. http://dx.doi.org/10.1145/3019612.3019912.
Texte intégralBu, T., A. Chen, S. Vander Wiel et T. Woo. « Design and Evaluation of a Fast and Robust Worm Detection Algorithm ». Dans Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications. IEEE, 2006. http://dx.doi.org/10.1109/infocom.2006.100.
Texte intégralKorzec, Tomasz, et Ulli Wolff. « A worm-inspired algorithm for the simulation of Abelian gauge theories ». Dans The XXVIII International Symposium on Lattice Field Theory. Trieste, Italy : Sissa Medialab, 2011. http://dx.doi.org/10.22323/1.105.0029.
Texte intégralRapports d'organisations sur le sujet "Worm Algorithm"
Allende López, Marcos, Diego López, Sergio Cerón, Antonio Leal, Adrián Pareja, Marcelo Da Silva, Alejandro Pardo et al. Quantum-Resistance in Blockchain Networks. Inter-American Development Bank, juin 2021. http://dx.doi.org/10.18235/0003313.
Texte intégralStriuk, Andrii, Olena Rybalchenko et Svitlana Bilashenko. Development and Using of a Virtual Laboratory to Study the Graph Algorithms for Bachelors of Software Engineering. [б. в.], novembre 2020. http://dx.doi.org/10.31812/123456789/4462.
Texte intégralBoman, Erik G., Umit V. Catalyurek, Cedric Chevalier, Karen D. Devine, Assefaw H. Gebremedhin, Paul D. Hovland, Alex Pothen et al. Combinatorial Algorithms to Enable Computational Science and Engineering : Work from the CSCAPES Institute. Office of Scientific and Technical Information (OSTI), janvier 2015. http://dx.doi.org/10.2172/1167393.
Texte intégralLVOVICH, Ya, A. PREOBRAZHENSKIY et Yu PREOBRAZHENSKIY. ANALYSIS OF TRANSPORT SYSTEM MANAGEMENT CAPABILITIES. Science and Innovation Center Publishing House, 2022. http://dx.doi.org/10.12731/2070-7568-2022-11-1-4-44-53.
Texte intégralBaader, Franz, et Ralf Küsters. Matching Concept Descriptions with Existential Restrictions Revisited. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.98.
Texte intégralBaader, Franz, et Ralf Küsters. Matching Concept Descriptions with Existential Restrictions Revisited. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.98.
Texte intégralKüsters, Ralf, et Ralf Molitor. Computing Least Common Subsumers in ALEN. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.110.
Texte intégralKüsters, Ralf, et Ralf Molitor. Computing Least Common Subsumers in ALEN. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.110.
Texte intégralAyoul-Guilmard, Q., S. Ganesh, M. Nuñez, R. Tosi, F. Nobile, R. Rossi et C. Soriano. D5.3 Report on theoretical work to allow the use of MLMC with adaptive mesh refinement. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.002.
Texte intégralHodgdon, Taylor, Anthony Fuentes, Jason Olivier, Brian Quinn et Sally Shoop. Automated terrain classification for vehicle mobility in off-road conditions. Engineer Research and Development Center (U.S.), avril 2021. http://dx.doi.org/10.21079/11681/40219.
Texte intégral