Browsing a component library using Non-functional Information

This paper highlights the role of non-functional information when reusing from a component library. We describe a method for selecting appropriate implementations of Ada packages taking non-functional constraints into account; these constraints model the context of reuse. Constraints take the form of queries using an interface description language called NoFun, which is also used to state non-functional information in Ada packages; query results are trees of implementations, following the import relationships between components. We define two different situations when reusing components, depending whether we take the library being searched as closed or extendible. The resulting tree of implementations can be manipulated by the user to solve ambiguities, to state default behaviours, and by the like. As part of the proposal, we face the problem of computing from code the non-functional information that determines the selection process.

A(-infinity)-interpolation in the ball

We give a necessary and sufficient condition for a sequence [ak}k in the unit ball of C° to be interpolating for the class A~°° of holomorphic functions with polynomial growth. The condition, which goes along the lines of the ones given by Berenstein and Li for some weighted spaces of entire functions and by Amar for H°° functions in the ball, is given in terms of the derivatives of m > n functions F Fm e A~°° vanishing on {ak)k.

Integrative analysis of the Regulatory Region of the FGFR3 Oncogene

The study of transcriptional regulation often needs the integration of diverse yet independent data. In the present work, sequence conservation, predic-tion of transcription factor binding sites (TFBS) and gene expression analysis have been applied to the detection of putative transcription factor (TF) modules in the regulatory region of the FGFR3 oncogene. Several TFs with conserved binding sites in the FGFR3 regulatory region have shown high positive or negative corre-lation with FGFR3 expression both in urothelial carcinoma and in benign nevi. By means of conserved TF cluster analysis, two different TF modules have been iden-tified in the promoter and first intron of FGFR3 gene. These modules contain acti-vating AP2, E2F, E47 and SP1 binding sites plus motifs for EGR with possible repressor function.

A Robust Multiple Feature Approach To Endpoint Detection In Car Environment Based On Advanced Classifiers

In this paper we propose an endpoint detection system based on the use of several features extracted from each speech frame, followed by a robust classifier (i.e Adaboost and Bagging of decision trees, and a multilayer perceptron) and a finite state automata (FSA). We present results for four different classifiers. The FSA module consisted of a 4-state decision logic that filtered false alarms and false positives. We compare the use of four different classifiers in this task. The look ahead of the method that we propose was of 7 frames, which are the number of frames that maximized the accuracy of the system. The system was tested with real signals recorded inside a car, with signal to noise ratio that ranged from 6 dB to 30dB. Finally we present experimental results demonstrating that the system yields robust endpoint detection.

A Canonical Genetic Algorithm for Blind Inversion of Linear Channels

It is well known the relationship between source separation and blind deconvolution: If a filtered version of an unknown i.i.d. signal is observed, temporal independence between samples can be used to retrieve the original signal, in the same manner as spatial independence is used for source separation. In this paper we propose the use of a Genetic Algorithm (GA) to blindly invert linear channels. The use of GA is justified in the case of small number of samples, where other gradient-like methods fails because of poor estimation of statistics.

Post-Nonlinear Mixtures and Beyond

Although sources in general nonlinear mixturm arc not separable iising only statistical independence, a special and realistic case of nonlinear mixtnres, the post nonlinear (PNL) mixture is separable choosing a suited separating system. Then, a natural approach is based on the estimation of tho separating Bystem parameters by minimizing an indcpendence criterion, like estimated mwce mutual information. This class of methods requires higher (than 2) order statistics, and cannot separate Gaarsian sources. However, use of [weak) prior, like source temporal correlation or nonstationarity, leads to other source separation Jgw rithms, which are able to separate Gaussian sourra, and can even, for a few of them, works with second-order statistics. Recently, modeling time correlated s011rces by Markov models, we propose vcry efficient algorithms hmed on minimization of the conditional mutual information. Currently, using the prior of temporally correlated sources, we investigate the fesihility of inverting PNL mixtures with non-bijectiw non-liacarities, like quadratic functions. In this paper, we review the main ICA and BSS results for riunlinear mixtures, present PNL models and algorithms, and finish with advanced resutts using temporally correlated snu~sm

Initialisation of Nonlinearities for PNL and Wiener systems Inversion

This paper proposes a very fast method for blindly initial- izing a nonlinear mapping which transforms a sum of random variables. The method provides a surprisingly good approximation even when the basic assumption is not fully satis¯ed. The method can been used success- fully for initializing nonlinearity in post-nonlinear mixtures or in Wiener system inversion, for improving algorithm speed and convergence.

Blind channel deconvolution of real world signals using source separation techniques

In this paper we present a method for blind deconvolution of linear channels based on source separation techniques, for real word signals. This technique applied to blind deconvolution problems is based in exploiting not the spatial independence between signals but the temporal independence between samples of the signal. Our objective is to minimize the mutual information between samples of the output in order to retrieve the original signal. In order to make use of use this idea the input signal must be a non-Gaussian i.i.d. signal. Because most real world signals do not have this i.i.d. nature, we will need to preprocess the original signal before the transmission into the channel. Likewise we should assure that the transmitted signal has non-Gaussian statistics in order to achieve the correct function of the algorithm. The strategy used for this preprocessing will be presented in this paper. If the receiver has the inverse of the preprocess, the original signal can be reconstructed without the convolutive distortion.

Improving a leaves automatic recognition process using PCA

In this work we present a simulation of a recognition process with perimeter characterization of a simple plant leaves as a unique discriminating parameter. Data coding allowing for independence of leaves size and orientation may penalize performance recognition for some varieties. Border description sequences are then used, and Principal Component Analysis (PCA) is applied in order to study which is the best number of components for the classification task, implemented by means of a Support Vector Machine (SVM) System. Obtained results are satisfactory, and compared with [4] our system improves the recognition success, diminishing the variance at the same time.

Automatic Recognition of Leaves by Shape Detection Pre-Processing with Ica

In this work we present a simulation of a recognition process with perimeter characterization of a simple plant leaves as a unique discriminating parameter. Data coding allowing for independence of leaves size and orientation may penalize performance recognition for some varieties. Border description sequences are then used to characterize the leaves. Independent Component Analysis (ICA) is then applied in order to study which is the best number of components to be considered for the classification task, implemented by means of an Artificial Neural Network (ANN). Obtained results with ICA as a pre-processing tool are satisfactory, and compared with some references our system improves the recognition success up to 80.8% depending on the number of considered independent components.

Coherency and sharpness measures by using ICA algorithms. An investigation for Alzheimer’s disease discrimination

In this paper, we present a comprehensive study of different Independent Component Analysis (ICA) algorithms for the calculation of coherency and sharpness of electroencephalogram (EEG) signals, in order to investigate the possibility of early detection of Alzheimer’s disease (AD). We found that ICA algorithms can help in the artifact rejection and noise reduction, improving the discriminative property of features in high frequency bands (specially in high alpha and beta ranges). In addition to different ICA algorithms, the optimum number of selected components is investigated, in order to help decision processes for future works.

Investigation of ICA algorithms for feature extraction of EEG signals in discrimination of Alzheimer disease

In this paper we present a quantitative comparisons of different independent component analysis (ICA) algorithms in order to investigate their potential use in preprocessing (such as noise reduction and feature extraction) the electroencephalogram (EEG) data for early detection of Alzhemier disease (AD) or discrimination between AD (or mild cognitive impairment, MCI) and age-match control subjects.

Blind Inversion of Wiener Systems

A system in which a linear dynamic part is followed by a non linear memoryless distortion a Wiener system is blindly inverted This kind of systems can be modelised as a postnonlinear mixture and using some results about these mixtures an e cient algorithm is proposed Results in a hard situation are presented and illustrate the e ciency of this algorithm

Differences of Functional Connectivity Brain Network in Emotional Judgment

Using combined emotional stimuli, combining photos of faces and recording of voices, we investigated the neural dynamics of emotional judgment using scalp EEG recordings. Stimuli could be either combioned in a congruent, or a non-congruent way.. As many evidences show the major role of alpha in emotional processing, the alpha band was subjected to be analyzed. Analysis was performed by computing the synchronization of the EEGs and the conditions congruent vs. non-congruent were compared using statistical tools. The obtained results demonstrate that scalp EEG ccould be used as a tool to investigate the neural dynamics of emotional valence and discriminate various emotions (angry, happy and neutral stimuli).

Parameterization of written signatures based on EFD

In this work we propose a method to quantify written signatures from digitalized images based on the use of Elliptical Fourier Descriptors (EFD). As usually signatures are not represented as a closed contour, and being that a necessary condition in order to apply EFD, we have developed a method that represents the signatures by means of a set of closed contours. One of the advantages of this method is that it can reconstruct the original shape from all the coefficients, or an approximated shape from a reduced set of them finding the appropriate number of EFD coefficients required for preserving the important information in each application. EFD provides accurate frequency information, thus the use of EFD opens many possibilities. The method can be extended to represent other kind of shapes.