Search results for "Machine learning"
showing 10 items of 1464 documents
PAN-AFRICAN MOBILE BELTS AS EVIDENCE FOR A TRANSITIONAL TECTONIC REGIME FROM INTRAPLATE OROGENY TO PLATE MARGIN OROGENY
1979
Pan-African belts of the African mainland and the Arabian-Nubian Shield exhibit evolutionary features which are either compatible with intracontinental ensialic development or with plate margin and Wilson cycle tectonics. Some of these belts are discussed and, considered together, they appear to reflect variations in crustal mobility during a transitional tectonic regime from intraplate to plate margin orogeny which lasted some 50. Ma from ca. 1000 Ma to ca. 500 Ma ago.
An IoT and Fog Computing-Based Monitoring System for Cardiovascular Patients with Automatic ECG Classification Using Deep Neural Networks
2020
Telemedicine and all types of monitoring systems have proven to be a useful and low-cost tool with a high level of applicability in cardiology. The objective of this work is to present an IoT-based monitoring system for cardiovascular patients. The system sends the ECG signal to a Fog layer service by using the LoRa communication protocol. Also, it includes an AI algorithm based on deep learning for the detection of Atrial Fibrillation and other heart rhythms. The automatic detection of arrhythmias can be complementary to the diagnosis made by the physician, achieving a better clinical vision that improves therapeutic decision making. The performance of the proposed system is evaluated on a…
Weights Space Exploration Using Genetic Algorithms for Meta-classifier in Text Document Classification
2012
Development of an Automatic Pollen Classification System Using Shape, Texture and Aperture Features
2015
International audience; Automatic detection and classification of pollen species has value for use inside of palynologic allergen studies. Traditional labeling of different pollen species requires an expert biologist to classify particles by sight, and is therefore time-consuming and expensive. Here, an automatic process is developed which segments the particle contour and uses the extracted features for the classification process. We consider shape features, texture features and aperture features and analyze which are useful. The texture features analyzed include: Gabor Filters, Fast Fourier Transform, Local Binary Patterns, Histogram of Oriented Gradients, and Haralick features. We have s…
Sähköä ja alkemiaa: Tekoälydiskurssit Yleisradion verkkoartikkeleissa
2021
Tässä artikkelissa tarkastelemme sitä, millaisena ja miten tekoäly esitetään suomalaisessa julkisessa keskustelussa, ja ketkä tekoälystä suurelle yleisölle kertovat. Aineistona olemme käyttäneet Yleisradion verkkosivujen tekoälyä käsitteleviä artikkeleja. Tulosten perusteella tekoälystä pääsevät kertomaan useimmin talouden ja teollisuuden aloilla työskentelevät miehet. Aineistossa esiintyneet tekoälytulevaisuuskuvaukset pitäytyvät pitkälti nykyisen länsikeskeisen kapitalistisen maailmankuvan sisällä. Toisin sanoen, ne eivät haastaneet tai ylittäneet vallitsevaa status quoa, vaan näkivät tulevaisuuden pikemminkin lineaarisena kehityksenä nykytilasta. Aiemman tutkimuksen perusteella yleinen k…
On the impact of forgetting on learning machines
1995
People tend not to have perfect memories when it comes to learning, or to anything else for that matter. Most formal studies of learning, however, assume a perfect memory. Some approaches have restricted the number of items that could be retained. We introduce a complexity theoretic accounting of memory utilization by learning machines. In our new model, memory is measured in bits as a function of the size of the input. There is a hierarchy of learnability based on increasing memory allotment. The lower bound results are proved using an unusual combination of pumping and mutual recursion theorem arguments. For technical reasons, it was necessary to consider two types of memory : long and sh…
Movie Script Similarity Using Multilayer Network Portrait Divergence
2020
International audience; This paper addresses the question of movie similarity through multilayer graph similarity measures. Recent work has shown how to construct multilayer networks using movie scripts, and how they capture different aspects of the stories. Based on this modeling, we propose to rely on the multilayer structure and compute different similarities, so we may compare movies, not from their visual content, summary, or actors, but actually from their own storyboard. We propose to do so using “portrait divergence”, which has been recently introduced to compute graph distances from summarizing graph characteristics. We illustrate our approach on the series of six Star Wars movies.
Supervised learning of time-independent Hamiltonians for gate design
2018
We present a general framework to tackle the problem of finding time-independent dynamics generating target unitary evolutions. We show that this problem is equivalently stated as a set of conditions over the spectrum of the time-independent gate generator, thus transforming the task to an inverse eigenvalue problem. We illustrate our methodology by identifying suitable time-independent generators implementing Toffoli and Fredkin gates without the need for ancillae or effective evolutions. We show how the same conditions can be used to solve the problem numerically, via supervised learning techniques. In turn, this allows us to solve problems that are not amenable, in general, to direct ana…
Tabu search for the dynamic Bipartite Drawing Problem
2018
Abstract Drawings of graphs have many applications and they are nowadays well-established tools in computer science in general, and optimization in particular. Project scheduling is one of the many areas in which representation of graphs constitutes an important instrument. The experience shows that the main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion to achieve it. Incremental or dynamic graph drawing is an emerging topic in this context, where we seek to preserve the layout of a graph over successive drawings. In this paper, we target the edge crossing reduction in the context of incremental graph drawing. Specifically…
Incorporating hypothetical knowledge into the process of inductive synthesis
1996
The problem of inductive inference of functions from hypothetical knowledge is investigated in this paper. This type of inductive inference could be regarded as a generalization of synthesis from examples that can be directed not only by input/output examples but also by knowledge of, e. g., functional description's syntactic structure or assumptions about the process of function evaluation. We show that synthesis of this kind is possible by efficiently enumerating the hypothesis space and illustrate it with several examples.