Síntese de árvores de padrões Fuzzy através de Programação Genética Cartesiana.

Esta dissertação apresenta um sistema de indução de classificadores fuzzy. Ao invés de utilizar a abordagem tradicional de sistemas fuzzy baseados em regras, foi utilizado o modelo de Árvore de Padrões Fuzzy(APF), que é um modelo hierárquico, com uma estrutura baseada em árvores que possuem como nós internos operadores lógicos fuzzy e as folhas são compostas pela associação de termos fuzzy com os atributos de entrada. O classificador foi obtido sintetizando uma árvore para cada classe, esta árvore será uma descrição lógica da classe o que permite analisar e interpretar como é feita a classificação. O método de aprendizado originalmente concebido para a APF foi substituído pela Programação Genética Cartesiana com o intuito de explorar melhor o espaço de busca. O classificador APF foi comparado com as Máquinas de Vetores de Suporte, K-Vizinhos mais próximos, florestas aleatórias e outros métodos Fuzzy-Genéticos em diversas bases de dados do UCI Machine Learning Repository e observou-se que o classificador APF apresenta resultados competitivos. Ele também foi comparado com o método de aprendizado original e obteve resultados comparáveis com árvores mais compactas e com um menor número de avaliações.

EEG signal classification for BCI applications by wavelets and interval type-2 fuzzy logic systems

The nonlinear, noisy and outlier characteristics of electroencephalography (EEG) signals inspire the employment of fuzzy logic due to its power to handle uncertainty. This paper introduces an approach to classify motor imagery EEG signals using an interval type-2 fuzzy logic system (IT2FLS) in a combination with wavelet transformation. Wavelet coefficients are ranked based on the statistics of the receiver operating characteristic curve criterion. The most informative coefficients serve as inputs to the IT2FLS for the classification task. Two benchmark datasets, named Ia and Ib, downloaded from the brain-computer interface (BCI) competition II, are employed for the experiments. Classification performance is evaluated using accuracy, sensitivity, specificity and F-measure. Widely-used classifiers, including feedforward neural network, support vector machine, k-nearest neighbours, AdaBoost and adaptive neuro-fuzzy inference system, are also implemented for comparisons. The wavelet-IT2FLS method considerably dominates the comparable classifiers on both datasets, and outperforms the best performance on the Ia and Ib datasets reported in the BCI competition II by 1.40% and 2.27% respectively. The proposed approach yields great accuracy and requires low computational cost, which can be applied to a real-time BCI system for motor imagery data analysis.

Fuzzy system with tabu search learning for classification of motor imagery data

This paper introduces an approach to classify EEG signals using wavelet transform and a fuzzy standard additive model (FSAM) with tabu search learning mechanism. Wavelet coefficients are ranked based on statistics of the Wilcoxon test. The most informative coefficients are assembled to form a feature set that serves as inputs to the tabu-FSAM. Two benchmark datasets, named Ia and Ib, downloaded from the brain-computer interface (BCI) competition II are employed for the experiments. Classification performance is evaluated using accuracy, mutual information, Gini coefficient and F-measure. Widely-used classifiers, including feedforward neural network, support vector machine, k-nearest neighbours, ensemble learning Adaboost and adaptive neuro-fuzzy inference system, are also implemented for comparisons. The proposed tabu-FSAM method considerably dominates the competitive classifiers, and outperforms the best performance on the Ia and Ib datasets reported in the BCI competition II.

EEG signal analysis for BCI application using fuzzy system

An approach to EEG signal classification for brain-computer interface (BCI) application using fuzzy standard additive model is introduced in this paper. The Wilcoxon test is employed to rank wavelet coefficients. Top ranking wavelets are used to form a feature set that serves as inputs to the fuzzy classifiers. Experiments are carried out using two benchmark datasets, Ia and Ib, downloaded from the BCI competition II. Prevalent classifiers including feedforward neural network, support vector machine, k-nearest neighbours, ensemble learning Adaboost and adaptive neuro-fuzzy inference system are also implemented for comparisons. Experimental results show the dominance of the proposed method against competing approaches.

Classificador Fisherface Fuzzy para o reconhecimento de faces

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Static analysis of executables for collaborative malware detection on Android

Smartphones are getting increasingly popular and several malwares appeared targeting these devices. General countermeasures to smartphone malwares are currently limited to signature-based antivirus scanners which efficiently detect known malwares, but they have serious shortcomings with new and unknown malwares creating a window of opportunity for attackers. As smartphones become host for sensitive data and applications, extended malware detection mechanisms are necessary complying with the corresponding resource constraints. The contribution of this paper is twofold. First, we perform static analysis on the executables to extract their function calls in Android environment using the command readelf. Function call lists are compared with malware executables for classifying them with PART, Prism and Nearest Neighbor Algorithms. Second, we present a collaborative malware detection approach to extend these results. Corresponding simulation results are presented.

Fast exact nearest neighbour matching in high dimensions using d-D Sort

Data structures such as k-D trees and hierarchical k-means trees perform very well in approximate k nearest neighbour matching, but are only marginally more effective than linear search when performing exact matching in high-dimensional image descriptor data. This paper presents several improvements to linear search that allows it to outperform existing methods and recommends two approaches to exact matching. The first method reduces the number of operations by evaluating the distance measure in order of significance of the query dimensions and terminating when the partial distance exceeds the search threshold. This method does not require preprocessing and significantly outperforms existing methods. The second method improves query speed further by presorting the data using a data structure called d-D sort. The order information is used as a priority queue to reduce the time taken to find the exact match and to restrict the range of data searched. Construction of the d-D sort structure is very simple to implement, does not require any parameter tuning, and requires significantly less time than the best-performing tree structure, and data can be added to the structure relatively efficiently.

Gold nanoresistors with near-constant resistivity in the cryogenic-to-room temperature range

Using a multiple plasma deposition-annealing (MDA) technique, we have fabricated an Au nanoisland-based thin film nanoresistor with a very low temperature coefficient of electrical resistivity in a cryogenic-to-room temperature range of 10 to 300 K. The nanoislanded gold film was deposited on a SiO2/Si wafer (500 nm SiO2 thickness) between two 300 nm thick Au electrodes which were separated by 100 m. A sophisticated selection of the thickness of the nanoislanded gold film, the annealing temperature, as well as the number of deposition/annealing cycles resulted in the fabrication of a nanoresistor with a temperature coefficient of electrical resistivity of 2.1 × 10-3 K-1 and the resistivity deviation not exceeding 2% in a cryogenic-to-room temperature range. We have found that the constant resistivity regime of the nanoisland-based thin film nanoresistor corresponds to a minimized nanoisland activation energy (approximately 0.3 meV). This energy can be minimized by reducing the nearest neighbor distance and increasing the size of the Au nanoislands in the optimized nanoresistor structure. It is shown that the constant resistivity nanoresistor operates in the regime where the thermally activated electron tunneling is compensated by the negative temperature dependence of the metallic-type conductivity of nanoislands. Our results are relevant to the development of commercially viable methods of nanoresistor production for various nanoelectronics-based devices. The proposed MDA technique also provides the opportunity to fabricate large arrays of metallic nanoparticles with controllable size, shapes and inter-nanoparticle gaps.

A quantification of the interaction and spatial ordering in nano-arrays

This paper reports on the use of a local order measure to quantify the spatial ordering of a quantum dot array (QDA). By means of electron ground state energy analysis in a quantum dot pair, it is demonstrated that the length scale required for such a measure to characterize the opto-electronic properties of a QDA is of the order of a few QD radii. Therefore, as local order is the primary factor that affects the opto-electronic properties of an array of quantum dots of homogeneous size, this order was quantified through using the standard deviation of the nearest neighbor distances of the quantum dot ensemble. The local order measure is successfully applied to quantify spatial order in a range of experimentally synthesized and numerically generated arrays of nanoparticles. This measure is not limited to QDAs and has wide ranging applications in characterizing order in dense arrays of nanostructures.

Disaggregative Clustering Using the Concept of Mutual Nearest Neighborhood

A nonparametric, hierarchical, disaggregative clustering algorithm is developed using a novel similarity measure, called the mutual neighborhood value (MNV), which takes into account the conventional nearest neighbor ranks of two samples with respect to each other. The algorithm is simple, noniterative, requires low storage, and needs no specification of the expected number of clusters. The algorithm appears very versatile as it is capable of discerning spherical and nonspherical clusters, linearly nonseparable clusters, clusters with unequal populations, and clusters with lowdensity bridges. Changing of the neighborhood size enables discernment of strong or weak patterns.

Armchair or Zigzag? A tool for characterizing graphene edge

Electronic, magnetic, and structural properties of graphene flakes depend sensitively upon the type of edge atoms. We present a simple software tool for determining the type of edge atoms in a honeycomb lattice. The algorithm is based on nearest neighbor counting. Whether an edge atom is of armchair or zigzag type is decided by the unique pattern of its nearest neighbors. Particular attention is paid to the practical aspects of using the tool, as additional features such as extracting out the edges from the lattice could help in analyzing images from transmission microscopy or other experimental probes. Ultimately, the tool in combination with density-functional theory or tight-binding method can also be helpful in correlating the properties of graphene flakes with the different armchair-to-zigzag ratios. Program summary Program title: edgecount Catalogue identifier: AEIA_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEIA_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 66685 No. of bytes in distributed program, including test data, etc.: 485 381 Distribution format: tar.gz Programming language: FORTRAN 90/95 Computer: Most UNIX-based platforms Operating system: Linux, Mac OS Classification: 16.1, 7.8 Nature of problem: Detection and classification of edge atoms in a finite patch of honeycomb lattice. Solution method: Build nearest neighbor (NN) list; assign types to edge atoms on the basis of their NN pattern. Running time: Typically similar to second(s) for all examples. (C) 2010 Elsevier B.V. All rights reserved.

Brownian dynamics simulation of dense binary colloidal mixtures. II. Translational and bond-orientational order

We report the Brownian dynamics simulation results on the translational and bond-angle-orientational correlations for charged colloidal binary suspensions as the interparticle interactions are increased to form a crystalline (for a volume fraction phi = 0.2) or a glassy (phi = 0.3) state. The translational order is quantified in terms of the two- and four-point density autocorrelation functions whose comparisons show that there is no growing correlation length near the glass transition. The nearest-neighbor orientational order is determined in terms of the quadratic rotational invariant Q(l) and the bond-orientational correlation functions g(l)(t). The l dependence of Q(l) indicates that icosahedral (l = 6) order predominates at the cost of the cubic order (l = 4) near the glass as well as the crystal transition. The density and orientational correlation functions for a supercooled liquid freezing towards a glass fit well to the streched-exponential form exp[-(t/tau)(beta)]. The average relaxation times extracted from the fitted stretched-exponential functions as a function of effective temperatures T* obey the Arrhenius law for liquids freezing to a crystal whereas these obey the Vogel-Tamman-Fulcher law exp[AT(0)*/(T* - T-0*)] for supercooled Liquids tending towards a glassy state. The value of the parameter A suggests that the colloidal suspensions are ''fragile'' glass formers like the organic and molecular liquids.

Solubility and activity of oxygen in liquid germanium and germanium copper alloys

The solubility of oxygen in liquid germanium in the temperature range 1233 to 1397 K, and in liquid germanium-copper alloys at 1373 K, in equilibrium with GeO2 has been measured by the phase equilibration technique. The solubility of oxygen in pure germanium is given by the relation R470 log(at. pct 0)=-6470/T+4.24 (±0.07). The standard free energy of solution of oxygen in liquid germanium is calculated from the saturation solubility, and recently measured values for the free energy of formation of GeO2, assuming that oxygen obeys Sievert’s law up to the saturation limit. For the reaction, 1/2 O2(g)→ OGe ΔG° =-39,000 + 3.21T (±500) cal = -163,200 + 13.43T (±2100) J. where the standard state for dissolved oxygen is that which makes the value of activity equal to the concentration (in at. pct), in the limit, as concentration approaches zero. The effect of copper on the activity of oxygen dissolved in liquid germanium is found to be in good agreement with that predicted by a quasichemical model in which each oxygen was assumed to be bonded to four metal atoms and the nearest neighbor metal atoms to an oxygen atom are assumed to lose approximately half of their metallic bonds.

Percolation and connectivity in AB random geometric graphs

Given two independent Poisson point processes Phi((1)), Phi((2)) in R-d, the AB Poisson Boolean model is the graph with the points of Phi((1)) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centered at these points contains at least one point of Phi((2)). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d >= 2 and derive bounds fora critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and tau n in the unit cube. The AB random geometric graph is defined as above but with balls of radius r. We derive a weak law result for the largest nearest-neighbor distance and almost-sure asymptotic bounds for the connectivity threshold.