Drift Correction Methods for gas Chemical Sensors in Artificial Olfaction Systems: Techniques and Challenges

In this chapter the authors introduce the main challenges faced when developing drift correction techniques and will propose a deep overview of state-of-the-art methodologies that have been proposed in the scientific literature trying to underlying pros and cons of these techniques and focusing on challenges still open and waiting for solution

Design Issues and Challenges of File Systems for Flash Memories

This chapter discusses how to properly address the issues of using NAND flash memories as mass-memory devices from the native file system standpoint. We hope that the ideas and the solutions proposed in this chapter will be a valuable starting point for designers of NAND flash-based mass-memory devices

Median topographic maps for biomedical data sets

Median clustering extends popular neural data analysis methods such as the self-organizing map or neural gas to general data structures given by a dissimilarity matrix only. This offers flexible and robust global data inspection methods which are particularly suited for a variety of data as occurs in biomedical domains. In this chapter, we give an overview about median clustering and its properties and extensions, with a particular focus on efficient implementations adapted to large scale data analysis

Optimal calibration in immunoassay and inference on the coefficient of variation

This thesis examines and develops statistical methods for design and analysis with applications in immunoassay and other analytical techniques. In immunoassay, concentrations of components in clinical samples are measured using antibodies. The responses obtained are related to the concentrations in the samples. The relationship between response and concentration is established by fitting a calibration curve to responses of samples with known concentrations, called calibrators or standards. The concentrations in the clinical samples are estimated, through the calibration curve, by inverse prediction. The optimal choice of calibrator concentrations is dependent on the true relationship between response and concentration. A locally optimal design is conditioned on a given true relationship. This thesis presents a novel method that accounts for the variation in the true relationships by considering unconditional variances and expected values. For immunoassay, it is suggested that the average coefficient of variation in inverse predictions be minimised. In immunoassay, the coefficient of variation is the most common measure of variability. Several clinical samples or calibrators may share the same coefficient of variation, although they have different expected values. It is shown here that this phenomenon can be a consequence of a random variation in the dispensed volumes, and that inverse regression is appropriate when the random variation is in concentration rather than in response. An estimator of a common coefficient of variation that is shared by several clinical samples is proposed, and inferential methods are developed for common coefficients of variation in normally distributed data. These methods are based on McKay's chi-square approximation for the coefficient of variation. This study proves that McKay's approximation is noncentral beta distributed, and that it is asymptotically normal with mean n - 1 and variance slightly smaller than 2(n - 1)

Unsupervised clustering of IoT signals through feature extraction and self organizing maps

This thesis scope is to build a clustering model to inspect the structural properties of a dataset composed of IoT signals and to classify these through unsupervised clustering algorithms. To this end, a feature-based representation of the signals is used. Different feature selection algorithms are then used to obtain reduced feature spaces, so as to decrease the computational cost and the memory demand. Thus, the IoT signals are clustered using Self-Organizing Maps (SOM) and then evaluatedope

Parameterization of point-cloud freeform surfaces using adaptive sequential learning RBFnetworks

We propose a self-organizing Radial Basis Function (RBF) neural network method for parameterization of freeform surfaces from larger, noisy and unoriented point clouds. In particular, an adaptive sequential learning algorithm is presented for network construction from a single instance of point set. The adaptive learning allows neurons to be dynamically inserted and fully adjusted (e.g. their locations, widths and weights), according to mapping residuals and data point novelty associated to underlying geometry. Pseudo-neurons, exhibiting very limited contributions, can be removed through a pruning procedure. Additionally, a neighborhood extended Kalman filter (NEKF) was developed to significantly accelerate parameterization. Experimental results show that this adaptive learning enables effective capture of global low-frequency variations while preserving sharp local details, ultimately leading to accurate and compact parameterization, as characterized by a small number of neurons. Parameterization using the proposed RBF network provides simple, low cost and low storage solutions to many problems such as surface construction, re-sampling, hole filling, multiple level-of-detail meshing and data compression from unstructured and incomplete range data. Performance results are also presented for comparison