Search results for "informatica"
showing 10 items of 1003 documents
Words, Trees and Automata Minimization
2013
In this paper we explore some connections between some combinatorial properties of words and the study of extremal cases of the automata minimization process. An intermediate role is played by the notion od word trees for which some properties of words are generalized. In particular, we describe an infinite family of binary automata, called word automata and constructed by using standard sturmian words and more specifically Fibonacci words, that represent the extremal case of some well known automata minimization algorithms, such as Moore’s and Hopcroft’s methods. As well as giving an overview of the main results in this context, the main purpose of this paper is to prove that, even if a re…
Sviluppi della Intelligenza Computazionale: l'esempio del Sarcasm Detection
2016
Dopo un periodo prolungato in cui vigeva uno scarto persistente tra l’ottimismo dato dai grandi proclami di ricerca e la scarsità e frammentarietà di risultati veri e tangibili, viviamo (finalmente) nell’era delle grandi conquiste dell’Intelligenza Artificiale
A Quantum-Inspired Classifier for Early Web Bot Detection
2022
This paper introduces a novel approach, inspired by the principles of Quantum Computing, to address web bot detection in terms of real-time classification of an incoming data stream of HTTP request headers, in order to ensure the shortest decision time with the highest accuracy. The proposed approach exploits the analogy between the intrinsic correlation of two or more particles and the dependence of each HTTP request on the preceding ones. Starting from the a-posteriori probability of each request to belong to a particular class, it is possible to assign a Qubit state representing a combination of the aforementioned probabilities for all available observations of the time series. By levera…
The Whole Is Greater than the Sum of the Parts: A Multilayer Approach on Criminal Networks
2022
Traditional social network analysis can be generalized to model some networked systems by multilayer structures where the individual nodes develop relationships in multiple layers. A multilayer network is called multiplex if each layer shares at least one node with some other layer. In this paper, we built a unique criminal multiplex network from the pre-trial detention order by the Preliminary Investigation Judge of the Court of Messina (Sicily) issued at the end of the Montagna anti-mafia operation in 2007. Montagna focused on two families who infiltrated several economic activities through a cartel of entrepreneurs close to the Sicilian Mafia. Our network possesses three layers which sha…
EntityBot: Supporting Everyday Digital Tasks with Entity Recommendations
2021
Everyday digital tasks can highly benefit from systems that recommend the right information to use at the right time. However, existing solutions typically support only specific applications and tasks. In this demo, we showcase EntityBot, a system that captures context across application boundaries and recommends information entities related to the current task. The user’s digital activity is continuously monitored by capturing all content on the computer screen using optical character recognition. This includes all applications and services being used and specific to individuals’ computer usages such as instant messaging, emailing, web browsing, and word processing. A linear model is then …
Novel Combinatorial and Information-Theoretic Alignment-Free Distances for Biological Data Mining
2010
Among the plethora of alignment-free methods for comparing biological sequences, there are some that we have perceived as representative of the novel techniques that have been devised in the past few years and as being of a fundamental nature and of broad interest and applicability, ranging from combinatorics to information theory. In this chapter, we review these alignment free methods, by presenting both their mathematical definitions and the experiments in which they are involved in.
Integration of a structural features-based preclassifier and a man-machine interactive classifier for a fast multi-stroke character recognition
2003
A transputer-based parallel machine for handwritten character recognition is proposed. An algorithm based on structural features and on a tree classifier was used to accomplish the pre-classification of the unknown sample in order to speed up the recognition process. The algorithm for the final classification is based on the description of the strokes through Fourier descriptors. The learning phase is accomplished through a man-machine interactive process. The proposed system can expand its knowledge base. A special representation of this knowledge base is proposed in order to record a great amount of data in a suitable way. A fast multistroke handwritten isolated character recognition syst…
A MULTI-LAYER MODEL TO STUDY GENOME-SCALE POSITIONS OF NUCLEOSOMES
2007
The positioning of nucleosomes along chromatin has been implicated in the regulation of gene expression in eukaryotic cells, because packaging DNA into nucleosomes affects sequence accessibility. In this paper we propose a new model (called MLM) for the identification of nucleosomes and linker regions across DNA, consisting in a thresholding technique based on cut-set conditions. For this purpose we have defined a method to generate synthetic microarray data fully inspired from the approach that has been used by Yuan et al. Results have shown a good recognition rate on synthetic data, moreover, the $MLM$ shows a good agreement with the recently published method based on Hidden Markov Model …
Image Segmentation based on Genetic Algorithms Combination
2005
The paper describes a new image segmentation algorithm called Combined Genetic segmentation which is based on a genetic algorithm. Here, the segmentation is considered as a clustering of pixels and a similarity function based on spatial and intensity pixel features is used. The proposed methodology starts from the assumption that an image segmentation problem can be treated as a Global Optimization Problem. The results of the image segmentations algorithm has been compared with recent existing techniques. Several experiments, performed on real images, show good performances of our approach compared to other existing methods.
A Medium Level Language for Pyramid Architectures
1989
In the paper a Parallel C Languages for pyramid architectures is described. The concept of context is introduced in order to handle concurrence between processes in massive parallel machines. Feature implementation on the PAPIA-machine are given.