Relevant bibliographies by topics / Worm Algorithm

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Worm Algorithm'

Author: Grafiati
Published: 14 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Worm Algorithm.'

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 "Worm Algorithm"

1

Rindlisbacher, Tobias, and Philippe de Forcrand. "Worm algorithm for theCPN−1model." Nuclear Physics B 918 (May 2017): 178–219. http://dx.doi.org/10.1016/j.nuclphysb.2017.02.021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gaofei, Zheng, Wang Xiufeng, and Zhang Yanli. "The self-organizing worm algorithm." Journal of Systems Engineering and Electronics 18, no. 3 (September 2007): 650–54. http://dx.doi.org/10.1016/s1004-4132(07)60143-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Delgado, Y., and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Prokof'ev, N. V., B. V. Svistunov, and I. S. Tupitsyn. "“Worm” algorithm in quantum Monte Carlo simulations." Physics Letters A 238, no. 4-5 (February 1998): 253–57. http://dx.doi.org/10.1016/s0375-9601(97)00957-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kerl, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Janke, Wolfhard, Thomas Neuhaus, and Adriaan M. J. Schakel. "Critical loop gases and the worm algorithm." Nuclear Physics B 829, no. 3 (April 2010): 573–99. http://dx.doi.org/10.1016/j.nuclphysb.2009.12.024.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yang, XinYu, Yi Shi, and HuiJun Zhu. "Detection and location algorithm against local-worm." Science in China Series F: Information Sciences 51, no. 12 (August 27, 2008): 1935–46. http://dx.doi.org/10.1007/s11432-008-0132-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Salunkhe, Shamal, and 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 (January 16, 2022): 146–54. http://dx.doi.org/10.46328/ijonest.67.

Full text
Abstract:
The steganography is applied on text, image, video, and audio files. The steganography is useful for safe and secure data transmission. Video steganography is used to preserve confidential information of security applications. To improve security of the message, pixels locations are optimized using nature inspired algorithm. As conventional algorithms have a low convergence rate a new algorithm is proposed. A New algorithm is developed by combining two model algorithms namely, Water wave optimization (WWO) and Earth worm optimization (EWO) and is renamed as proposed Water-Earth Worm Optimization (WEWO) algorithm. The frames are preprocessed and extracted using Discrete Cosine transform (DCT) and Structured Similarity index (SSIM), respectively, as regular processing. For pixel prediction, the fitness function is obtained from neighborhood entropies in proposed algorithm. In this method, secret message is embedded with two level decomposition of Wavelet Transform (WT). In the proposed work is tested with ‘CAVIAR’ dataset. The Proposed WEWO-Deep RNN algorithm performance is tested with modular noises such as, pepper, salt and pepper noises. The proposed method gives enhanced performance, which is seen with the parameters, Peak Signal to Noise Ratio (PSNR), Mean Square Error (MSE), and Correlation Coefficient (CC) which defines image quality indices.
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Yifan, Prathamesh Pandit, Akhil Kandhari, Zehao Liu, and Kathryn A. Daltorio. "Rapidly Exploring Random Tree Algorithm-Based Path Planning for Worm-Like Robot." Biomimetics 5, no. 2 (June 5, 2020): 26. http://dx.doi.org/10.3390/biomimetics5020026.

Full text
Abstract:
Inspired by earthworms, worm-like robots use peristaltic waves to locomote. While there has been research on generating and optimizing the peristalsis wave, path planning for such worm-like robots has not been well explored. In this paper, we evaluate rapidly exploring random tree (RRT) algorithms for path planning in worm-like robots. The kinematics of peristaltic locomotion constrain the potential for turning in a non-holonomic way if slip is avoided. Here we show that adding an elliptical path generating algorithm, especially a two-step enhanced algorithm that searches path both forward and backward simultaneously, can make planning such waves feasible and efficient by reducing required iterations by up around 2 orders of magnitude. With this path planner, it is possible to calculate the number of waves to get to arbitrary combinations of position and orientation in a space. This reveals boundaries in configuration space that can be used to determine whether to continue forward or back-up before maneuvering, as in the worm-like equivalent of parallel parking. The high number of waves required to shift the body laterally by even a single body width suggests that strategies for lateral motion, planning around obstacles and responsive behaviors will be important for future worm-like robots.
APA, Harvard, Vancouver, ISO, and other styles
10

Hilool, Ali Khalid, Soukaena H. Hashem, and Shatha H. Jafer. "Intrusion detection system based on bagging with support vector machine." Indonesian Journal of Electrical Engineering and Computer Science 24, no. 2 (November 1, 2021): 1100. http://dx.doi.org/10.11591/ijeecs.v24.i2.pp1100-1106.

Full text
Abstract:
<p>Due to their rapid spread, computer worms perform harmful tasks in networks, posing a security risk; however, existing worm detection algorithms continue to struggle to achieve good performance and the reasons for that are: First, a large amount of irrelevant data affects classification accuracy. Second, individual classifiers do not detect all types of worms effectively. Third, many systems are based on outdated data, making them unsuitable for new worm species. The goal of the study is to use data mining algorithms to detect worms in the network because they have a high ability to detect new types accurately. The proposal is based on the UNSW NB15 dataset and uses a support vector machine to train and test the ensemble bagging algorithm. To detect various types of worms efficiently, the contribution suggests combining correlation and Chi2 feature selection method called Chi2-Corr to select relevant features and using support vector machine (SVM) in the bagging algorithm. The system achieved accuracy reaching 0.998 with Chi2-Corr, and 0.989, 0.992 with correlation and chi-square separately.</p>
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Worm Algorithm"

1

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.

Full text
Abstract:
Submitted by Fabio Sobreira Campos da Costa (fabio.sobreira@ufpe.br) on 2016-06-29T13:52:59Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) tese_final.pdf: 5635071 bytes, checksum: b300efb627e9ece412ad5936ab67e8e2 (MD5)
Made 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.
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
Condensed matter systems undergoing phase transitions rarely allow exact solutions. The presence of disorder renders the situation  even worse but collective Monte Carlo methods and parallel algorithms allow numerical descriptions. This thesis considers classical phase transitions in disordered spin systems in general and in effective models of superfluids with disorder and novel interactions in particular. Quantum phase transitions are considered via a quantum to classical mapping. Central questions are if the presence of defects changes universal properties and what qualitative implications follow for experiments. Common to the cases considered is that the disorder maps out correlated structures. All results are obtained using large-scale Monte Carlo simulations of effective models capturing the relevant degrees of freedom at the transition. Considering a model system for superflow aided by a defect network, we find that the onset properties are significantly altered compared to the $\lambda$-transition in $^{4}$He. This has qualitative implications on expected experimental signatures in a defect supersolid scenario. For the Bose glass to superfluid quantum phase transition in 2D we determine the quantum correlation time by an anisotropic finite size scaling approach. Without a priori assumptions on critical parameters, we find the critical exponent $z=1.8 \pm 0.05$ contradicting the long standing result $z=d$. Using a 3D effective model for multi-band type-1.5 superconductors we find that these systems possibly feature a strong first order vortex-driven phase transition. Despite its short-range nature details of the interaction are shown to play an important role. Phase transitions in disordered spin models exposed to correlated defect structures obtained via rapid quenches of critical loop and spin models are investigated. On long length scales the correlations are shown to decay algebraically. The decay exponents are expressed through known critical exponents of the disorder generating models. For cases where the disorder correlations imply the existence of a new long-range-disorder fixed point we determine the critical exponents of the disordered systems via finite size scaling methods of Monte Carlo data and find good agreement with theoretical expectations.

QC 20150306

APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
Abstract:
In this thesis, we make use of Monte Carlo techniques to address two rather different subjects in condensed matter physics. The first study deals with the characterization of a relatively novel and elusive phase of matter, the so-called supersolid, in which crystalline order and dissipationless flow coexist. While supersolidity is a well studied phenomenology in lattice models, we will be working here in continuous space, where much fewer results are available. Specifically, we study a soft core Bosonic system, quantum analog of thoroughly studied classical models, which displays an unambiguous supersolid phenomenology. In this system such a behavior is not obtained through Bose Condensation of lattice defects, but rather it is mean field in character. By computer simulations we characterize many properties of the system: of these, the most prominent are the phase diagram of the system and its excitation spectrum. This study is loosely related to the ultracold atom experimental field, as it is speculated that interparticle potential pertaining to the same class of the one employed here may be realized in this context. After the recent (and apparently definitive) ruling out of supersolidity effects in ^4He, it seems fair to state that ultracold atoms are the most promising candidate for the observation of this phenomenology. In this section we employ our own implementation of the worm algorithm on the continuum. The second part of this thesis is instead related to electronic structure, more specifically to the study of minimum energy pathways of reactions calculated via quantum Monte Carlo methods. In particular, we aim at assessing the computational feasibility and the accuracy of determining the most significant geometries of a reaction (initial/final and transition state) and its energy barrier via these stochastic techniques. To this end, we perform calculations on a set of simple reactions and compare the results with density functional theory and high level quantum chemistry calculations. We show that the employed technique indeed performs better than density functional for both geometries and energy barrier. Therefore our methodology is a good candidate to study reactions in which an high accuracy is needed, but it is not possible to employ high level quantum chemistry methods due to computational limitations. We believe that this study is significant also because of its systematic use of forces from Monte Carlo simulations. Although several studies have addressed various aspects of the problem of computing forces within quantum Monte Carlo accurately and efficiently, there is little awareness that such estimators are in fact mature, and consequently there are very few studies which actually employ them. We hope to show here that these estimators are actually ready to be used and provide good results. In this section we have mainly developed interfaces for existing Quantum Monte Carlo codes.
APA, Harvard, Vancouver, ISO, and other styles
4

Ohlsson, 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.

Full text
Abstract:
Denna text är delvis en dokumentation av min egna resa inom datorbaserat tonsättande, specifikt inom algoritmisk komposition. Det är även ett utforskande av den tankevärld som finns i anknytning till dessa metoder – där estetiska koncept och konsekvenser diskuteras. Texten kommer huvudsakligen att beröra metoder som gynnas av eller möjliggörs av teknologi. Jag har försökt att närma mig dessa ämnen holistiskt genom att diskutera allt från estetik, teknik, till konkreta realiseringar av särskilda musikaliska idéer. Till detta tillkommer även många notexempel, lite kod, och illustrationer – specifikt för att stödja förklaringarna av, för många musikstudenter, främmande utommusikaliska koncept.
APA, Harvard, Vancouver, ISO, and other styles
5

Stadtherr, Hans. "Work efficient parallel scheduling algorithms." [S.l. : s.n.], 1998. http://deposit.ddb.de/cgi-bin/dokserv?idn=962681369.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Thakkar, Darshan Suresh, and 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.

Full text
Abstract:
Short Word-Length refers to single-bit, two-bit or ternary processing systems. SWL systems use Sigma-Delta Modulation (SDM) technique to express an analogue or multi-bit input signal in terms of a high frequency single-bit stream. In Sigma-Delta Modulation, the input signal is coarsely quantized into a single-bit representation by sampling it at a much higher rate than twice the maximum input frequency viz. the Nyquist rate. This single-bit representation is almost exclusively filtered to remove conversion quantization noise and sample decimated to the Nyquist frequency in preparation for traditional signal processing. SWL algorithms have a huge potential in a variety of applications as they offer many advantages as compared to multi-bit approaches. Features of SWL include efficient hardware implementation, increased flexibility and massive cost savings. Field Programmable Gate Arrays (FPGAs) are SRAM/FLASH based integrated circuits that can be programmed and re-programmed by the end user. FPGAs are made up of arrays of logic gates, routing channels and I/O blocks. State-of-the-art FPGAs include features such as Advanced Clock Management, Dedicated Multipliers, DSP Slices, High Speed I/O and Embedded Microprocessors. A System-on-Programmable-Chip (SoPC) design approach uses some or all the aforementioned resources to create a complete processing system on the device itself, ensuring maximum silicon area utilization and higher speed by eliminating inter-chip communication overheads. This dissertation focuses on the application of SWL processing systems in audio Class-D Amplifiers and aims to prove the claims of efficient hardware implementation and higher speeds of operation. The analog Class-D Amplifier is analyzed and an SWL equivalent of the system is derived by replacing the analogue components with DSP functions wherever possible. The SWL Class-D Amplifier is implemented on an FPGA, the standard emulation platform, using VHSIC Hardware Description Languages (VHDL). The approach is taken a step forward by adding re-configurability and media selectivity and proposing SDM adaptivity to improve performance.
APA, Harvard, Vancouver, ISO, and other styles
7

CECCHINI, 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.

Full text
Abstract:
La presente tesi si occupa dell’induzione dei significati delle parole (ISP o word sense induction - WSI), una branca dell’elaborazione dei linguaggi naturali il cui scopo è individuare ed elencare automaticamente e in modo non supervisionato i possibili significati o sensi che un termine può assumere relativamente ai differenti contesti in cui esso viene impiegato, senza ricorrere a risorse esterne quali dizionari od ontologie. Fra i vari approcci alla ISP esistenti, ci siamo concentrati in particolare su quelli che modellano il contesto di una parola tramite un grafo, su cui viene fatto operare un algoritmo per partizionarlo: la partizione che ne risulta ha come interpretazione l’implicita descrizione dei possibili sensi di quella parola. Le nozioni fondamentali dell’ISP, alcuni concetti base e approcci alla ISP scelti fra la letteratura del campo vengono presentati e analizzati nella prima parte del lavoro. Nella seconda parte introduciamo il nostro triplice contributo. Per prima cosa definiamo ed esploriamo la distanza di Jaccard pesata (assieme a una sua versione non pesata), cioè una distanza sui nodi di un grafo non orientato con pesi positivi, che usiamo per ottenere relazioni di secondo ordine dalle relazioni di primo ordine eventualmente modellate dal grafo (p.e. cooccorrenze). Inoltre, definiamo la nozione correlata di “arco passerella”, un arco “separatore” il cui peso è superiore alla media dei pesi sugli archi uscenti da una delle sue due estremità, e definiamo anche una nuova interpretazione sintetica delle curvatura di un grafo, vista come la differenza delle distanze di Jaccard pesata e non pesata sugli archi. La distanza di Jaccard da noi definita è alla base del nostro secondo contributo: tre nuovi algoritmi di clustering su grafo espressamente creati per l’ISP, rispettivamente l’algoritmo di clustering per passerelle, un algoritmo di clustering aggregativo e uno basato sulla curvatura. Il terzo contributo di questa tesi è un nuovo sistema di valutazione per algoritmi di clustering su grafo per l’ISP, il quale consiste di due collezioni di grafi (una per le cooccorrenze e una per le similarità semantiche) e di una nuova misura di valutazione ad hoc, entrambi sviluppati attorno all’idea di pseudoparola. Una pseudoparola è la fusione artificiale di due parole esistenti, usata come una nuova parola ambigua i cui (pseudo)significati sono perfettamente conosciuti. Tale sistema permette di valutare algoritmi per l’ISP su dati facilmente creabili ed espandibili. Svolgiamo inoltre una valutazione basata sulle pseudoparole per vari algoritmi di clustering su grafo, inclusi i tre da noi proposti. L'indagine di come i parametri di una pseudoparola influiscono sul risultato di un algoritmo, il confronto dei punteggi ottenuti da diverse metriche di valutazione, assieme all'individuazione dei loro bias, la grandezza dei clustering e le tendenze evidenziate dall'iperclustering, l'influenza del tipo di un grafo di parole (basato su similarità sintattiche o cooccorrenze) sul prodotto di un algoritmo – tutti questi fattori, preceduti da un'esauriente descrizione degli obiettivi e dalla definizione di nuovi concetti e strumenti per affrontarli, concorrono a dare una migliore comprensione del funzionamento e delle insidie dell'ISP su grafo. Sottolineiamo e isoliamo gli elementi che determinano l'aspetto dei risultati di un algoritmo, ne discutiamo le proprietà e i comportamenti in relazione alle caratteristiche del grafo di parole e stabiliamo i pro e i contro di ogni algoritmo. La nostra analisi fornisce una bussola sperimentale che aiuta a individuare con precisione le caratteristiche richieste da un algoritmo nell'ambito dell'ISP e a orientare la costruzione di un grafo di parole. In particolare, abbiamo evidenziato il contrasto fra paradigma e sintagma inerente ai grafi di parole basati su similarità semantiche e cooccorrenze.
This 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.
APA, Harvard, Vancouver, ISO, and other styles
8

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/.

Full text
Abstract:
Nesta dissertação estudaremos sistemas de bósons ultrafrios armadilhados em uma rede ótica quadrada bidimensional sem levar em consideração o confinamento harmônico. A dinâmica desses sistemas é bem descrita pelo modelo de Bose-Hubbard, que prevê uma transição de fase quântica de um superfluido para um isolante de Mott a temperaturas baixas, e pode ser induzida variando a profundidade do potencial da rede ótica. Apresentaremos o diagrama de fases dessa transição construído a partir de uma aproximação de campo médio e também com um cálculo numérico usando um algoritmo de Monte Carlo Quântico, denominado algoritmo Worm. Encontramos o ponto crítico para o primeiro lobo de Mott em ambos os casos, concordando com trabalhos anteriores.
This 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.
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
Abstract:
Path tracking has been an important issue in robotics for many decades now and it is used to give a robot entity the ability to follow a path. The many different algorithms used to do path tracking all have specific behaviors and may not be optimal or even work in all areas. To broaden the use of an existing path tracking algorithm, this report sets out to modify it to work in three dimensions instead of two.
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Worm Algorithm"

1

Eneko, Agirre, and Edmonds Philip Glenny, eds. Word sense disambiguation: Algorithms and applications. [New York]: Springer, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

1948-, Apostolico Alberto, Galil Zvi, and North Atlantic Treaty Organization. Scientific Affairs Division., eds. Combinatorial algorithms on words. Berlin: Springer-Verlag, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rosenberg, Jonathan B. How Debuggers work: Algorithms, data structures, and architecture. New York: John Wiley, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sachs, 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.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Potts, Christopher Nigel. Approximation algorithms for schedeling a single machine to minimize total late work. Fontainebleau: INSEAD, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cloughley, William R. Evaluation of work distribution algorithms and hardware topologies in a multi-Transputer network. Monterey, California: Naval Postgraduate School, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Speed arithmetic: Based on Vedic word-formulas. 3rd ed. Chennai: Vijaya Ramasubban, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Xie, Shane. Rapid One-of-a-kind Product Development: Strategies, Algorithms and Tools. London: Springer-Verlag London, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hughes, Roland. The Minimum You Need to Know about Logic to Work in It. USA: Logikal Solutions, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mundel, Marvin Everett. The white-collar knowledge worker: Measuring and improving productivity and effectiveness : algorithms and PC programs. [Tokyo, Japan]: Asian Productivity Organization, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Worm Algorithm"

1

Brabazon, Anthony, and Seán McGarraghy. "Worm Foraging Algorithm." In Natural Computing Series, 253–62. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-59156-8_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Prokof’ev, Nikolay. "Diagrammatic Monte Carlo and Worm Algorithm Techniques." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lim, Donghyun, Jinwook Chung, and Seongjin Ahn. "Using Genetic Algorithm for Network Status Learning and Worm Virus Detection Scheme." In Intelligent Data Engineering and Automated Learning – IDEAL 2006, 444–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11875581_54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gonzalez-Gomez, J., I. Gonzalez, F. Gomez-Arribas, and E. Boemo. "Evaluation of a Locomotion Algorithm for Worm-Like Robots on FPGA-Embedded Processors." In Reconfigurable Computing: Architectures and Applications, 24–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11802839_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kim, Jungwon, William O. Wilson, Uwe Aickelin, and Julie McLeod. "Cooperative Automated Worm Response and Detection ImmuNe ALgorithm(CARDINAL) Inspired by T-Cell Immunity and Tolerance." In Lecture Notes in Computer Science, 168–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11536444_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bansal, Jagdish Chand, Prathu Bajpai, Anjali Rawat, and Atulya K. Nagar. "Conclusion and Further Research Directions." In Sine Cosine Algorithm for Optimization, 105–6. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-9722-8_6.

Full text
Abstract:
AbstractThe increasing complexity of real-world optimization problems demands fast, robust, and efficient meta-heuristic algorithms. The popularity of these intelligent techniques is gaining popularity day by day among researchers from various disciplines of science and engineering. The sine cosine algorithm is a simple population-based stochastic approach for handling different optimization problems. In this work, we have discussed the basic sine cosine algorithm for continuous optimization problems, the multi-objective sine cosine algorithm for handling multi-objective optimization problems, and the discrete (or binary) versions of sine cosine algorithm for discrete optimization problems. Sine cosine algorithm (SCA) has reportedly shown competitive results when compared to other meta-heuristic algorithms. The easy implementation and less number of parameters make the SCA algorithm, a recommended choice for performing various optimization tasks. In this present chapter, we have studied different modifications and strategies for the advancement of the sine cosine algorithm. The incorporation of concepts like opposition-based learning, quantum simulation, and hybridization with other meta-heuristic algorithms have increased the efficiency and robustness of the SCA algorithm, and meanwhile, these techniques have also increased the application spectrum of the sine cosine algorithm.
APA, Harvard, Vancouver, ISO, and other styles
7

Malitsky, Yuri. "Related Work." In Instance-Specific Algorithm Configuration, 7–14. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11230-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Guan, Ji, Wang Fang, and Mingsheng Ying. "Robustness Verification of Quantum Classifiers." In Computer Aided Verification, 151–74. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_7.

Full text
Abstract:
AbstractSeveral important models of machine learning algorithms have been successfully generalized to the quantum world, with potential speedup to training classical classifiers and applications to data analytics in quantum physics that can be implemented on the near future quantum computers. However, quantum noise is a major obstacle to the practical implementation of quantum machine learning. In this work, we define a formal framework for the robustness verification and analysis of quantum machine learning algorithms against noises. A robust bound is derived and an algorithm is developed to check whether or not a quantum machine learning algorithm is robust with respect to quantum training data. In particular, this algorithm can find adversarial examples during checking. Our approach is implemented on Google’s TensorFlow Quantum and can verify the robustness of quantum machine learning algorithms with respect to a small disturbance of noises, derived from the surrounding environment. The effectiveness of our robust bound and algorithm is confirmed by the experimental results, including quantum bits classification as the “Hello World” example, quantum phase recognition and cluster excitation detection from real world intractable physical problems, and the classification of MNIST from the classical world.
APA, Harvard, Vancouver, ISO, and other styles
9

Jarrahi, Mohammad Hossein, and Will Sutherland. "Algorithmic Management and Algorithmic Competencies: Understanding and Appropriating Algorithms in Gig Work." In Information in Contemporary Society, 578–89. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-15742-5_55.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Barth, Lukas, Stephen G. Kobourov, and Sergey Pupyrev. "Experimental Comparison of Semantic Word Clouds." In Experimental Algorithms, 247–58. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07959-2_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Worm Algorithm"

1

Khan, Aarfa, Shweta Shrivastava, and Vineet Richariya. "Normalized Worm-hole Local Intrusion Detection Algorithm(NWLIDA)." In 2014 International Conference on Computer Communication and Informatics (ICCCI). IEEE, 2014. http://dx.doi.org/10.1109/iccci.2014.6921748.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wei Wang, Yingying Wang, Jinghao Qi, Houxiang Zhang, and Jianwei Zhang. "The CPG control algorithm for a climbing worm robot." In 2008 3rd IEEE Conference on Industrial Electronics and Applications (ICIEA). IEEE, 2008. http://dx.doi.org/10.1109/iciea.2008.4582600.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Jie, Min-fang Peng, Liang Zhu, Hong-wei Che, and Jing-ying Hou. "Distribution Network Vulnerability Analysis Based on the Worm Algorithm." In 2016 International Conference on Electrical Engineering and Automation (EEA2016). WORLD SCIENTIFIC, 2017. http://dx.doi.org/10.1142/9789813220362_0054.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Maillart, Vidushi, and Urs Wenger. "Worm algorithm for the O(2N) Gross-Neveu model." In The XXVIII International Symposium on Lattice Field Theory. Trieste, Italy: Sissa Medialab, 2011. http://dx.doi.org/10.22323/1.105.0257.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Xiao, Fengtao, Huaping Hu, Bo Liu, and Xin Chen. "PTBBWD: A Fast Process Traffic Behavior Based Worm Detection Algorithm." In 2008 International Seminar on Future Information Technology and Management Engineering. IEEE, 2008. http://dx.doi.org/10.1109/fitme.2008.150.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gessner, Andrzej. "Theoretical Basis of Generation of Face Worm Gear Drive With Duplex Worm." In ASME 8th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2006. http://dx.doi.org/10.1115/esda2006-95519.

Full text
Abstract:
New type of face worm gear drive with double-lead worm is proposed. The advantages of that gear in comparison to contemporary known gears are also mentioned. The shaping process of the face worm gear is carrying out by means of a single point tool. The same insert is used for cutting the duplex worm. Using a single point tool instead of hobbing cutter considerably reduces the manufacturing cost, in which the share of tool production plays the main role. The shaping process is performed on a CNC milling machine with or without additional equipment. Two main methods of shaping depended on setting up the tool machine are presented. One of them requires no special equipment but a single point tool with insert of specific tool included angle, whilst the second uses a constructed tooling. There are also described 3 methods of shaping the face toothing, which depends on the used technology. Geometry of that face worm gear drive is presented and described. The tooth depth is constant along the whole tooth line. Nominal width of tooth section as well as its location depends on the lead difference of the worm. Provided scheme can be used to calculate those parameters. The total length of the duplex worm is calculated by taking into consideration the internal and external diameters of the worm gear and the additional length which is needed to reduce the backlash. The shape and size of the single point tool is determined according to the worm and the necessary geometric model is provided. There are also given criteria, which limit the maximum length of worm and its maximum lead angle. A complete algorithm describing the designing process of that type of gear is presented in the final part of the article.
APA, Harvard, Vancouver, ISO, and other styles
7

Xue, Li, and Zhihui Hu. "Research of Worm Intrusion Detection Algorithm Based on Statistical Classification Technology." In 2015 8th International Symposium on Computational Intelligence and Design (ISCID). IEEE, 2015. http://dx.doi.org/10.1109/iscid.2015.215.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kang, Donghwa, Seoyeon Kim, Jinman Jung, Bongjae Kim, Hong Min, and Junyoung Heo. "Genetic algorithm based patching scheme for worm containment on social network." In SAC 2017: Symposium on Applied Computing. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3019612.3019912.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bu, T., A. Chen, S. Vander Wiel, and T. Woo. "Design and Evaluation of a Fast and Robust Worm Detection Algorithm." In Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications. IEEE, 2006. http://dx.doi.org/10.1109/infocom.2006.100.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Korzec, Tomasz, and Ulli Wolff. "A worm-inspired algorithm for the simulation of Abelian gauge theories." In The XXVIII International Symposium on Lattice Field Theory. Trieste, Italy: Sissa Medialab, 2011. http://dx.doi.org/10.22323/1.105.0029.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Worm Algorithm"

1

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, June 2021. http://dx.doi.org/10.18235/0003313.

Full text
Abstract:
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Cambridge Quantum Computing (CQC), and Tecnológico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH, will be no longer secure. Quantum computers will be able to break them within a short period of time. Similarly, Grover's algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work. Today, there are hundreds of billions of dollars denominated in cryptocurrencies that rely on blockchain ledgers as well as the thousands of blockchain-based applications storing value in blockchain networks. Cryptocurrencies and blockchain-based applications require solutions that guarantee quantum resistance in order to preserve the integrity of data and assets in their public and immutable ledgers. We have designed and developed a layer-two solution to secure the exchange of information between blockchain nodes over the internet and introduced a second signature in transactions using post-quantum keys. Our versatile solution can be applied to any blockchain network. In our implementation, quantum entropy was provided via the IronBridge Platform from CQC and we used LACChain Besu as the blockchain network.
APA, Harvard, Vancouver, ISO, and other styles
2

Striuk, Andrii, Olena Rybalchenko, and Svitlana Bilashenko. Development and Using of a Virtual Laboratory to Study the Graph Algorithms for Bachelors of Software Engineering. [б. в.], November 2020. http://dx.doi.org/10.31812/123456789/4462.

Full text
Abstract:
The paper presents an analysis of the importance of studying graph algorithms, the reasons for the need to implement this project and its subsequent use. The existing analogues analysis is carried out, due to which a list of advantages and disadvantages is formed and taken into account in developing the virtual laboratory. A web application is created that clearly illustrates the work of graph algorithms, such as Depth-First Search, Dijkstra’s Shortest Path, Floyd- Warshall, Kruskal Minimum Cost Spanning Tree Algorithm. A simple and user- friendly interface is developed and it is supported by all popular browsers. The software product is provided with user registration and authorization functions, chat communication, personal cabinet editing and viewing the statistics on web- application use. An additional condition is taken into account at the design stage, namely the flexibility of the architecture, which envisaged the possibility of easy expansion of an existing functionality. Virtual laboratory is used at Kryvyi Rih National University to training students of specialty 121 Software Engineering in the disciplines “Algorithms and Data Structures” and “Discrete Structures”.
APA, Harvard, Vancouver, ISO, and other styles
3

Boman, 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), January 2015. http://dx.doi.org/10.2172/1167393.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

LVOVICH, Ya, A. PREOBRAZHENSKIY, and 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.

Full text
Abstract:
The paper discusses the task related to the management of the transport system. The possibilities of securing orders are shown. An algorithm for evaluating work at the stages of marketing research is given.
APA, Harvard, Vancouver, ISO, and other styles
5

Baader, Franz, and Ralf Küsters. Matching Concept Descriptions with Existential Restrictions Revisited. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.98.

Full text
Abstract:
An abridged version of this technical report has been submitted to KR 2000. Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the CLASSIC system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. Motivated by an application in chemical process engineering, which requires a description language with existential restrictions, this paper investigates the matching problem in Description Logics with existential restrictions. It turns out that existential restrictions make matching more complex in two respects. First, whereas matching in sublanguages of CLASSIC is polynomial, deciding the existence of matchers is an NP-complete problem in the presence of existential restrictions. Second, whereas in sublanguages of Classic solvable matching problems have a unique least matcher, this is not the case for languages with existential restrictions. Thus, it is not a priori clear which of the (possibly infinitely many) matchers should be returned by a matching algorithm. After determining the complexity of the decision problem, the present paper first investigates the question of what are 'interesting' sets of matchers, and then describes algorithms for computing these sets for the languages EL (which allows for conjunction and existential restrictions) and ALE (which additionally allows for value restrictions, primitive negation, and the bottom concept).
APA, Harvard, Vancouver, ISO, and other styles
6

Baader, Franz, and Ralf Küsters. Matching Concept Descriptions with Existential Restrictions Revisited. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.98.

Full text
Abstract:
An abridged version of this technical report has been submitted to KR 2000. Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the CLASSIC system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. Motivated by an application in chemical process engineering, which requires a description language with existential restrictions, this paper investigates the matching problem in Description Logics with existential restrictions. It turns out that existential restrictions make matching more complex in two respects. First, whereas matching in sublanguages of CLASSIC is polynomial, deciding the existence of matchers is an NP-complete problem in the presence of existential restrictions. Second, whereas in sublanguages of Classic solvable matching problems have a unique least matcher, this is not the case for languages with existential restrictions. Thus, it is not a priori clear which of the (possibly infinitely many) matchers should be returned by a matching algorithm. After determining the complexity of the decision problem, the present paper first investigates the question of what are 'interesting' sets of matchers, and then describes algorithms for computing these sets for the languages EL (which allows for conjunction and existential restrictions) and ALE (which additionally allows for value restrictions, primitive negation, and the bottom concept).
APA, Harvard, Vancouver, ISO, and other styles
7

Küsters, Ralf, and Ralf Molitor. Computing Least Common Subsumers in ALEN. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.110.

Full text
Abstract:
Computing the least common subsumer (lcs) in description logics is an inference task first introduced for sublanguages of CLASSIC. Roughly speaking, the lcs of a set of concept descriptions is the most specific concept description that subsumes all of the input descriptions. As such, the lcs allows to extract the commonalities from given concept descriptions, a task essential for several applications like, e.g., inductive learning, information retrieval, or the bottom-up construction of KR-knowledge bases. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN, which allows for both constructors (as well as concept conjunction, primitive negation, and value restrictions). The proof of correctness of our lcs algorithm is based on an appropriate structural characterization of subsumption in ALEN also introduced in this paper.
APA, Harvard, Vancouver, ISO, and other styles
8

Küsters, Ralf, and Ralf Molitor. Computing Least Common Subsumers in ALEN. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.110.

Full text
Abstract:
Computing the least common subsumer (lcs) in description logics is an inference task first introduced for sublanguages of CLASSIC. Roughly speaking, the lcs of a set of concept descriptions is the most specific concept description that subsumes all of the input descriptions. As such, the lcs allows to extract the commonalities from given concept descriptions, a task essential for several applications like, e.g., inductive learning, information retrieval, or the bottom-up construction of KR-knowledge bases. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN, which allows for both constructors (as well as concept conjunction, primitive negation, and value restrictions). The proof of correctness of our lcs algorithm is based on an appropriate structural characterization of subsumption in ALEN also introduced in this paper.
APA, Harvard, Vancouver, ISO, and other styles
9

Ayoul-Guilmard, Q., S. Ganesh, M. Nuñez, R. Tosi, F. Nobile, R. Rossi, and 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.

Full text
Abstract:
This documents describes several studies undertaken to assess the applicability of MultiLevel Monte Carlo (MLMC) methods to problems of interest; namely in turbulent fluid flow over civil engineering structures. Several numerical experiments are presented wherein the convergence of quantities of interest with mesh parameters are studied at different Reynolds’ numbers and geometries. It was found that MLMC methods could be used successfully for low Reynolds’ number flows when combined with appropriate Adaptive Mesh Refinement (AMR) strategies. However, the hypotheses for optimal MLMC performance were found to not be satisfied at higher turbulent Reynolds’ numbers despite the use of AMR strategies. Recommendations are made for future research directions based on these studies. A tentative outline for an MLMC algorithm with adapted meshes is made, as well as recommendations for alternatives to MLMC methods for cases where the underlying assumptions for optimal MLMC performance are not satisfied.
APA, Harvard, Vancouver, ISO, and other styles
10

Hodgdon, Taylor, Anthony Fuentes, Jason Olivier, Brian Quinn, and Sally Shoop. Automated terrain classification for vehicle mobility in off-road conditions. Engineer Research and Development Center (U.S.), April 2021. http://dx.doi.org/10.21079/11681/40219.

Full text
Abstract:
The U.S. Army is increasingly interested in autonomous vehicle operations, including off-road autonomous ground maneuver. Unlike on-road, off-road terrain can vary drastically, especially with the effects of seasonality. As such, vehicles operating in off-road environments need to be in-formed about the changing terrain prior to departure or en route for successful maneuver to the mission end point. The purpose of this report is to assess machine learning algorithms used on various remotely sensed datasets to see which combinations are useful for identifying different terrain. The study collected data from several types of winter conditions by using both active and passive, satellite and vehicle-based sensor platforms and both supervised and unsupervised machine learning algorithms. To classify specific terrain types, supervised algorithms must be used in tandem with large training datasets, which are time consuming to create. However, unsupervised segmentation algorithms can be used to help label the training data. More work is required gathering training data to include a wider variety of terrain types. While classification is a good first step, more detailed information about the terrain properties will be needed for off-road autonomy.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Worm Algorithm' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography