Search results for "Pattern matching"
showing 10 items of 44 documents
Phase Coherence in Conceptual Spaces for Conversational Agents
2010
This chapter attempts to enhance the traditional chatbots with associative/intuitive capabilities. According to these considerations, it tries to create a conversational agent model that takes into consideration, aside from the traditional rule - based dialogue mechanism, also some sort of intuitive reasoning ability. The aim is in attempting to overcome the rigid pattern - matching rules, proposing a "phase coherence" paradigm into a semantic space. With this locution the chapter intend that the vectors representing the elements of the dialogue are coherent with the context. The chapter trust that this intuitive - associative capability can be obtained using the LSA methodology. The repres…
A Lightweight Software Architecture for Robot Navigation and Visual Logging through Environmental Landmarks Recognition
2006
A robot architecture with real-time performance in navigation tasks is presented. The system architecture is multi-threaded with shared memory and fast message passing through static signalling. In this paper, we focused on the reactive layer components and its straightforward implementation. The proposed architecture is described with reference to an experimental setup, in which the robot task is visual logging of environmental landmarks detected on the basis of sensor readings. Our experimental results show how the robot is able to identify, make snapshots and log a set of landmarks by matching 2D geometric patterns.
Learning temporal patterns for anomaly intrusion detection
2002
For the last decade an explosive spread of computer systems and computer networks has resulted in a society that is increasingly dependent on information stored on these systems. A computer system connected to the network is accessible from another computer in this network regardless of its geographical position. Along with providing many benefits for legitimate users this technology creates almost unlimited opportunities for malicious persons, which using software vulnerabilities may successfully penetrate the networked computer systems. In order to eliminate potential devastating consequences caused by breaches in computer systems, more and more attention is drawn to the information secur…
Alignment-Free Sequence Comparison over Hadoop for Computational Biology
2015
Sequence comparison i.e., The assessment of how similar two biological sequences are to each other, is a fundamental and routine task in Computational Biology and Bioinformatics. Classically, alignment methods are the de facto standard for such an assessment. In fact, considerable research efforts for the development of efficient algorithms, both on classic and parallel architectures, has been carried out in the past 50 years. Due to the growing amount of sequence data being produced, a new class of methods has emerged: Alignment-free methods. Research in this ares has become very intense in the past few years, stimulated by the advent of Next Generation Sequencing technologies, since those…
Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices
1999
AbstractWe describe fast parallel algorithms for building index data structures that can be used to gather various statistics on square matrices. The main data structure is the Lsuffix tree, which is a generalization of the classical suffix tree for strings. Given ann×ntext matrixA, we build our data structures inO(logn) time withn2processors on a CRCW PRAM, so that we can quickly processAin parallel as follows: (i) report some statistical information aboutA, e.g., find the largest repeated square submatrices that appear at least twice inAor determine, for each position inA, the smallest submatrix that occurs only there; (ii) given, on-line, anm×mpattern matrixPAT, check whether it occurs i…
Text Compression Using Antidictionaries
1999
International audience; We give a new text compression scheme based on Forbidden Words ("antidictionary"). We prove that our algorithms attain the entropy for balanced binary sources. They run in linear time. Moreover, one of the main advantages of this approach is that it produces very fast decompressors. A second advantage is a synchronization property that is helpful to search compressed data and allows parallel compression. Our algorithms can also be presented as "compilers" that create compressors dedicated to any previously fixed source. The techniques used in this paper are from Information Theory and Finite Automata.
Hardware Computation of Moment Functions in a Silicon Retina Using Binary Patterns
2006
International audience; We present in this paper a method for implementing moment functions in a CMOS retina for shape recognition applications. The method is based on the use of binary patterns and it allows the computation of different moment functions such geometric and Zernike moments of any orders by an adequate choice of the binary patterns. The advantages of the method over other methods described in the literature is that it is particularly suitable for the design of a programmable retina circuit where moment functions of different orders are obtained by simply loading the correct binary patterns into the memory devices implemented on the circuit. The moment values computed by the m…
User profile matching in social networks
2010
International audience; Inter-social networks operations and functionalities are required in several scenarios (data integration, data enrichment, information retrieval, etc.). To achieve this, matching user profiles is required. Current methods are so restrictive and do not consider all the related problems. Particularly, they assume that two profiles describe the same physical person only if the values of their Inverse Functional Property or IFP (e.g. the email address, homepage, etc.) are the same. However, the observed trend in social networks is not fully compatible with this assumption since users tend to create more than one social network account (for personal use, for work, etc.) w…
Modélisation, Analyse et Traitement de l'Information
2016
Mes activités de recherche s’articulent, d’une part, autour de l’instrumentation et du génie biomédical,et, d’autre part, autour du traitement et de la transmission non linéaire de l’information. Elles sebasent sur la modélisation des signaux à partir de modèles non linéaires (principalement modèles deréaction-diffusion. . . ) continus (EDP) et discrets (numériques). Dans cette partie, d’un point de vuefondamental, des phénomènes dynamiques complexes ou chaotiques sont caractérisés à travers l’analyse,la classification, la reconnaissance des motifs dans des signaux physiologiques ou issus des circuitsélectroniques. Un autre axe sur lequel je travaille concerne l’analyse et le traitement des…
A trie-based approach for compacting automata
2004
International audience; We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression and does not need to retain the input string, differently from other methods based on compact automata. The net effect is that of obtaining a lighter automaton than the directed acyclic word graph (DAWG) of Blumer et al., as it uses less nodes, still with arcs labeled by single characters.