Search results for " artificial intelligence"
showing 10 items of 1992 documents
Supporting Autonomy in Agent Oriented Methodologies
2016
Designing a software solution for a complex systems is always a demanding task, it becomes much more complex if we consider to design a multi agent system where agents have to exhibit autonomy; which abstractions and which concepts to take into consideration when using a design methodology we would like to support autonomy? In this paper, we answer this question by studying and analyzing literature on the concept of agents in order to establish the basic set of concepts an agent oriented methodology has to deal with.
A Windowing strategy for Distributed Data Mining optimized through GPUs
2017
Abstract This paper introduces an optimized Windowing based strategy for inducing decision trees in Distributed Data Mining scenarios. Windowing consists in selecting a sample of the available training examples (the window) to induce a decision tree with an usual algorithm, e.g., J48; finding instances not covered by this tree (counter examples) in the remaining training examples, adding them to the window to induce a new tree; and repeating until a termination criterion is met. In this way, the number of training examples required to induce the tree is reduced considerably, while maintaining the expected accuracy levels; which is paid in terms of time performance. Our proposed enhancements…
Acoustic Detection of Moving Vehicles
2018
This chapter outlines a robust algorithm to detect the arrival of a vehicle of arbitrary type when other noises are present. It is done via analysis of its acoustic signature against an existing database of recorded and processed acoustic signals. To achieve it with minimum number of false alarms, a construction of a training database of acoustic signatures of signals emitted by vehicles using the distribution of the energies among blocks of wavelet packet coefficients (waveband spectra, see Sect. 4.6) is combined with a procedure of random search for a near-optimal footprint (RSNOFP). The number of false alarms in the detection is minimized even under severe conditions such as: signals emi…
Maximum Lifetime of the Wireless Sensor Network and the Gossip Problem
2018
In the gossip problem each node of the graph G possesses a unique piece of information - the gossip message. A sequence of one-way or two-way communications between pair of nodes is made to spread the messages so that any node of the graph knows all the gossips. The question is, what is the minimum number of calls between pairs of nodes needed to exchange all gossip messages? The solution to the two-way communication gossip problem is that \(2N-4\) calls (\(N\ge 4\)) suffice if and only if the graph contains a four cycle subgraph. For one-way communication problem the classical results states that in a strongly connected graph \(2N-2\) calls (\(N\ge 4\)) suffice. In this paper we consider t…
Adaptive Threshold, Wavelet and Hilbert Transform for QRS Detection in Electrocardiogram Signals
2017
This paper combines Hilbert and Wavelet transforms and an adaptive threshold technique to detect the QRS complex of electrocardiogram signals. The method is performed in a window framework. First, the Wavelet transform is applied to the ECG signal to remove noise. Next, the Hilbert transform is applied to detect dominant peak points in the signal. Finally, the adaptive threshold technique is applied to detect R-peaks, Q, and S points. The performance of the algorithm is evaluated against the MIT-BIH arrhythmia database, and the numerical results indicated significant detection accuracy.
Manifold Learning with High Dimensional Model Representations
2020
Manifold learning methods are very efficient methods for hyperspectral image (HSI) analysis but, unless specifically designed, they cannot provide an explicit embedding map readily applicable to out-of-sample data. A common assumption to deal with the problem is that the transformation between the high input dimensional space and the (typically low) latent space is linear. This is a particularly strong assumption, especially when dealing with hyperspectral images due to the well-known nonlinear nature of the data. To address this problem, a manifold learning method based on High Dimensional Model Representation (HDMR) is proposed, which enables to present a nonlinear embedding function to p…
Cluster Aggregation for Analyzing Event-Related Potentials
2017
Topographic analysis are references independent for Event-Related Potentials (ERPs), and thus render statistically unambiguous results. This drives us to develop an effective clustering approach to finding temporal samples possessing similar topographies for analysing the temporal-spatial ERPs data. The previous study called CARTOOL used single clustering method to cluster ERP data. Indeed, given a clustering method, the quality of clustering varies with data and the number of clusters, motivating us to implement and compare multiple clustering algorithms via using multiple similarity measurements. By finding the minimum distance among the various clustering methods and selecting the most s…
Adoption of Constrained Application Protocol
2016
Among billions of Internet enabled devices that are expected to surround us in the near future, many will be resource constrained, i.e., will have limited power supply, processing power and memory. To cope with these limitations, the Constrained Application Protocol (CoAP) has been recently introduced as a lightweight alternative to HTTP for connecting the resource limited devices to the Web. Although the new protocol offers solid technical advantages, it remains uncertain whether a successful uptake will follow, as it depends also on its economic feasibility for the involved stakeholders. Therefore, this paper studies the techno-economic feasibility of CoAP using a systematic methodologica…
Line reconstruction using prior knowledge in single non-central view
2016
International audience; Line projections in non-central systems contain more geometric information than in central systems. The four degrees of freedom of the 3D line are mapped to the line-image and the 3D line can be theoretically recovered from 4 projecting rays (i.e. line-image points) from a single non-central view. In practice, extraction of line-images is consid- erably more difficult and the resulting reconstruction is imprecise and sensitive to noise. In this paper we present a minimal solution to recover the geometry of the 3D line from only three line-image points when the line is parallel to a given plane. A second minimal solution allows to recover the 3D line from two points w…
Convolutional Neural Network for Blind Mesh Visual Quality Assessment Using 3D Visual Saliency
2018
In this work, we propose a convolutional neural network (CNN) framework to estimate the perceived visual quality of 3D meshes without having access to the reference. The proposed CNN architecture is fed by small patches selected carefully according to their level of saliency. To do so, the visual saliency of the 3D mesh is computed, then we render 2D projections from the 3D mesh and its corresponding 3D saliency map. Afterward, the obtained views are split to obtain 2D small patches that pass through a saliency filter to select the most relevant patches. Experiments are conducted on two MVQ assessment databases, and the results show that the trained CNN achieves good rates in terms of corre…