Uma nova forma de calcular os centros dos Clusters em algoritmos de agrupamento tipo fuzzy c-means

Clustering data is a very important task in data mining, image processing and pattern recognition problems. One of the most popular clustering algorithms is the Fuzzy C-Means (FCM). This thesis proposes to implement a new way of calculating the cluster centers in the procedure of FCM algorithm which are called ckMeans, and in some variants of FCM, in particular, here we apply it for those variants that use other distances. The goal of this change is to reduce the number of iterations and processing time of these algorithms without affecting the quality of the partition, or even to improve the number of correct classifications in some cases. Also, we developed an algorithm based on ckMeans to manipulate interval data considering interval membership degrees. This algorithm allows the representation of data without converting interval data into punctual ones, as it happens to other extensions of FCM that deal with interval data. In order to validate the proposed methodologies it was made a comparison between a clustering for ckMeans, K-Means and FCM algorithms (since the algorithm proposed in this paper to calculate the centers is similar to the K-Means) considering three different distances. We used several known databases. In this case, the results of Interval ckMeans were compared with the results of other clustering algorithms when applied to an interval database with minimum and maximum temperature of the month for a given year, referring to 37 cities distributed across continents

Uma análise experimental de algoritmos exatos aplicados ao problema da árvore geradora multiobjetivo

The Multiobjective Spanning Tree Problem is NP-hard and models applications in several areas. This research presents an experimental analysis of different strategies used in the literature to develop exact algorithms to solve the problem. Initially, the algorithms are classified according to the approaches used to solve the problem. Features of two or more approaches can be found in some of those algorithms. The approaches investigated here are: the two-stage method, branch-and-bound, k-best and the preference-based approach. The main contribution of this research lies in the fact that no research was presented to date reporting a systematic experimental analysis of exact algorithms for the Multiobjective Spanning Tree Problem. Therefore, this work can be a basis for other research that deal with the same problem. The computational experiments compare the performance of algorithms regarding processing time, efficiency based on the number of objectives and number of solutions found in a controlled time interval. The analysis of the algorithms was performed for known instances of the problem, as well as instances obtained from a generator commonly used in the literature

O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico

The Hiker Dice was a game recently proposed in a software designed by Mara Kuzmich and Leonardo Goldbarg. In the game a dice is responsible for building a trail on an n x m board. As the dice waits upon a cell on the board, it prints the side that touches the surface. The game shows the Hamiltonian Path Problem Simple Maximum Hiker Dice (Hidi-CHS) in trays Compact Nth , this problem is then characterized by looking for a Hamiltonian Path that maximize the sum of marked sides on the board. The research now related, models the problem through Graphs, and proposes two classes of solution algorithms. The first class, belonging to the exact algorithms, is formed by a backtracking algorithm planed with a return through logical rules and limiting the best found solution. The second class of algorithms is composed by metaheuristics type Evolutionary Computing, Local Ramdomized search and GRASP (Greed Randomized Adaptative Search). Three specific operators for the algorithms were created as follows: restructuring, recombination with two solutions and random greedy constructive.The exact algorithm was teste on 4x4 to 8x8 boards exhausting the possibility of higher computational treatment of cases due to the explosion in processing time. The heuristics algorithms were tested on 5x5 to 14x14 boards. According to the applied methodology for evaluation, the results acheived by the heuristics algorithms suggests a better performance for the GRASP algorithm

Novos métodos determinísticos para gerar centros iniciais dos grupos no algoritmo fuzzy C-Means e variantes

Data clustering is applied to various fields such as data mining, image processing and pattern recognition technique. Clustering algorithms splits a data set into clusters such that elements within the same cluster have a high degree of similarity, while elements belonging to different clusters have a high degree of dissimilarity. The Fuzzy C-Means Algorithm (FCM) is a fuzzy clustering algorithm most used and discussed in the literature. The performance of the FCM is strongly affected by the selection of the initial centers of the clusters. Therefore, the choice of a good set of initial cluster centers is very important for the performance of the algorithm. However, in FCM, the choice of initial centers is made randomly, making it difficult to find a good set. This paper proposes three new methods to obtain initial cluster centers, deterministically, the FCM algorithm, and can also be used in variants of the FCM. In this work these initialization methods were applied in variant ckMeans.With the proposed methods, we intend to obtain a set of initial centers which are close to the real cluster centers. With these new approaches startup if you want to reduce the number of iterations to converge these algorithms and processing time without affecting the quality of the cluster or even improve the quality in some cases. Accordingly, cluster validation indices were used to measure the quality of the clusters obtained by the modified FCM and ckMeans algorithms with the proposed initialization methods when applied to various data sets

Comitês de Classificadores para o Reconhecimento Multibiométrico em Dados Biométricos Revogáveis

This work discusses the application of techniques of ensembles in multimodal recognition systems development in revocable biometrics. Biometric systems are the future identification techniques and user access control and a proof of this is the constant increases of such systems in current society. However, there is still much advancement to be developed, mainly with regard to the accuracy, security and processing time of such systems. In the search for developing more efficient techniques, the multimodal systems and the use of revocable biometrics are promising, and can model many of the problems involved in traditional biometric recognition. A multimodal system is characterized by combining different techniques of biometric security and overcome many limitations, how: failures in the extraction or processing the dataset. Among the various possibilities to develop a multimodal system, the use of ensembles is a subject quite promising, motivated by performance and flexibility that they are demonstrating over the years, in its many applications. Givin emphasis in relation to safety, one of the biggest problems found is that the biometrics is permanently related with the user and the fact of cannot be changed if compromised. However, this problem has been solved by techniques known as revocable biometrics, which consists of applying a transformation on the biometric data in order to protect the unique characteristics, making its cancellation and replacement. In order to contribute to this important subject, this work compares the performance of individual classifiers methods, as well as the set of classifiers, in the context of the original data and the biometric space transformed by different functions. Another factor to be highlighted is the use of Genetic Algorithms (GA) in different parts of the systems, seeking to further maximize their eficiency. One of the motivations of this development is to evaluate the gain that maximized ensembles systems by different GA can bring to the data in the transformed space. Another relevant factor is to generate revocable systems even more eficient by combining two or more functions of transformations, demonstrating that is possible to extract information of a similar standard through applying different transformation functions. With all this, it is clear the importance of revocable biometrics, ensembles and GA in the development of more eficient biometric systems, something that is increasingly important in the present day

Growth mechanism of octahedron-like BaMoO4 microcrystals processed in microwave-hydrothermal: Experimental observations and computational modeling

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

Comparação entre análises para permanência no rebanho de vacas Nelore utilizando modelo linear e modelo de limiar

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

The application of interpolating MLS approximations to the analysis of MHD flows

The element-free Galerkin method (EFGM) is a very attractive technique for solutions of partial differential equations, since it makes use of nodal point configurations which do not require a mesh. Therefore, it differs from FEM-like approaches by avoiding the need of meshing, a very demanding task for complicated geometry problems. However, the imposition of boundary conditions is not straightforward, since the EFGM is based on moving-least-squares (MLS) approximations which are not necessarily interpolants. This feature requires, for instance, the introduction of modified functionals with additional unknown parameters such as Lagrange multipliers, a serious drawback which leads to poor conditionings of the matrix equations. In this paper, an interpolatory formulation for MLS approximants is presented: it allows the direct introduction of boundary conditions, reducing the processing time and improving the condition numbers. The formulation is applied to the study of two-dimensional magnetohydrodynamic flow problems, and the computed results confirm the accuracy and correctness of the proposed formulation. (C) 2002 Elsevier B.V. All rights reserved.

Modal representation of three-phase lines applying two transformation matrices: Evaluation of its eigenvectors

The objective of this paper is to show an alternative representation in time domain of a non-transposed three-phase transmission line decomposed in its exact modes by using two transformation matrices. The first matrix is Clarke's matrix that is real, frequency independent, easily represented in computational transient programs (EMTP) and separates the line into Quasi-modes alpha, beta and zero. After that, Quasi-modes a and zero are decomposed into their exact modes by using a modal transformation matrix whose elements can be synthesized in time domain through standard curve-fitting techniques. The main advantage of this alternative representation is to reduce the processing time because a frequency dependent modal transformation matrix of a three-phase line has nine elements to be represented in time domain while a modal transformation matrix of a two-phase line has only four elements. This paper shows modal decomposition process and eigenvectors of a nontransposed three-phase line with a vertical symmetry plane whose nominal voltage is 440 kV and line length is 500 km.

Structural Refinement and Photoluminescence Properties of MnWO4 Nanorods Obtained by Microwave-Hydrothermal Synthesis

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Synthesis, growth process and photoluminescence properties of SrWO4 powders

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

Transmission system expansion planning by a branch-and-bound algorithm

A branch and bound (B& B) algorithm using the DC model, to solve the power system transmission expansion planning by incorporating the electrical losses in network modelling problem is presented. This is a mixed integer nonlinear programming (MINLP) problem, and in this approach, the so-called fathoming tests in the B&B algorithm were redefined and a nonlinear programming (NLP) problem is solved in each node of the B& B tree, using an interior-point method. Pseudocosts were used to manage the development of the B&B tree and to decrease its size and the processing time. There is no guarantee of convergence towards global optimisation for the MINLP problem. However, preliminary tests show that the algorithm easily converges towards the best-known solutions or to the optimal solutions for all the tested systems neglecting the electrical losses. When the electrical losses are taken into account, the solution obtained using the Garver system is better than the best one known in the literature.

Synthesis, Characterization, Anisotropic Growth and Photoluminescence of BaWO4

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

Microwave-assisted hydrothermal synthesis of nanocrystalline SnO powders

Tin oxide (SnO) powders were obtained by the microwave-assisted hydrothermal synthesis technique using SnCl2 center dot 2H(2)O as a precursor. By changing the hydrothermal processing time, temperature, the type of mineralizing agent (NaOH, KOH or NH4 OH) and its concentration, SnO crystals having different sizes and morphologies could be achieved. The powders were characterized by X-ray diffraction (X-ray), Field Emission Scanning Electron Microscopy (FE-SEM), High Resolution Transmission Electron Microscopy (HR-TEM) and Selected Area Electron Diffraction (SAED). The results showed that plate-like form is the characteristic morphology of growth and the TEM analyses indicate the growth direction as (200). (c) 2007 Elsevier B.V. All rights reserved.

A recursive approach to space resection using straight lines

An approach using straight lines as features to solve the photogrammetric space resection problem is presented. An explicit mathematical model relating straight lines, in both object and image space, is used. Based on this model, Kalman Filtering is applied to solve the space resection problem. The recursive property of the filter is used in an iterative process which uses the sequentially estimated camera location parameters to feedback to the feature extraction process in the image. This feedback process leads to a gradual reduction of the image space for feature searching, and consequently eliminates the bottleneck due to the high computational cost of the image segmentation phase. It also enables feature extraction and the determination of feature correspondence in image and object space in an automatic way, i.e., without operator interference. Results obtained from simulated and real data show that highly accurate space resection parameters are obtained as well as a progressive processing time reduction. The obtained accuracy, the automatic correspondence process, and the short related processing time show that the proposed approach can be used in many real-time machine vision systems, making possible the implementation of applications not feasible until now.