54 resultados para Topology-based methods


Relevância:

90.00% 90.00%

Publicador:

Resumo:

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

Relevância:

80.00% 80.00%

Publicador:

Resumo:

The paper presents an extended genetic algorithm for solving the optimal transmission network expansion planning problem. Two main improvements have been introduced in the genetic algorithm: (a) initial population obtained by conventional optimisation based methods; (b) mutation approach inspired in the simulated annealing technique, the proposed method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Excellent performance is reported in the test results section of the paper for a difficult large-scale real-life problem: a substantial reduction in investment costs has been obtained with regard to previous solutions obtained via conventional optimisation methods and simulated annealing algorithms; statistical comparison procedures have been employed in benchmarking different versions of the genetic algorithm and simulated annealing methods.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

It has been hypothesized that the AR (androgen receptor) gene binds the two PSA (prostate-specific antigen) alleles with differing affinities and may differentially influence prostate cancer risk. In this article, we report a case of adenocarcinoma of the prostate in a 56-year-old man with Klinefelter syndrome (47,XXY) and non-Hodgkin lymphoma, as well as the AR and PSA genotype. AR and PSA gene polymorphisms were analyzed by polymerase chain reaction-based methods using DNA from peripheral white blood cells and the prostate cancer. We determined the methylation status of the AR gene on the X chromosome. The patient presents with the AG genotype for the ARE-I (androgen response element) region of the PSA gene. We detect the presence of two short AR alleles with 19 and 11CAG repeats each. Unmethylated alleles were demonstrated for both. The shorter allele was inactive in more than 60% of total DNA in both control blood and prostate cancer cells. The presence of short AR alleles and the G allele of the PSA gene may contribute to the development of prostate cancer in a 47,XXY patient. (C) 2004 Elsevier B.V. All rights reserved.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Babesia bigemina infections were investigated in four genetic groups of beef cattle and in Rhipicephalus (Boophilus) microplus engorged female ticks. Blood samples and engorged female ticks were collected from 15 cows and 15 calves from each of the following genetic groups: Nelore, Angus x Nelore, Canchim x Nelore, and Simmental x Nelore. Microscopic examination of blood smears and tick hemolymph revealed that merozoites of B. bigemina (6/60) as well as kinetes of Babesia spp. (9/549) were only detected in samples (blood and ticks, respectively) originated from calves. PCR-based methods using primers for specific detection of B. bigemina revealed 100% infection in both calves and cows, regardless the genetic group. Tick infection was detected by nested-PCR amplifications showing that the frequency of B. bigemina was higher (P 0.01) in female ticks collected from calves (134/549) than in those collected from cows (52/553). The frequency of B. bigemina was similar in ticks collected from animals, either cows or calves, of the four genetic groups (P > 0.05). (C) 2008 Elsevier B.V. All rights reserved.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

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

Relevância:

80.00% 80.00%

Publicador:

Resumo:

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

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

80.00% 80.00%

Publicador:

Resumo:

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

Relevância:

80.00% 80.00%

Publicador:

Resumo:

This paper presents a novel, fast and accurate appearance-based method for infrared face recognition. By introducing the Optimum-Path Forest classifier, our objective is to get good recognition rates and effectively reduce the computational effort. The feature extraction procedure is carried out by PCA, and the results are compared to two other well known supervised learning classifiers; Artificial Neural Networks and Support Vector Machines. The achieved performance asserts the promise of the proposed framework. ©2009 IEEE.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

A method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipulate stack instead of using native call and ret instructions to achieve equivalent behavior. Since definition of context-sensitivity and algorithms for context-sensitive analysis have thus far been based on the specific semantics associated to procedure call and return operations, classic interprocedural analyses cannot be used reliably for analyzing programs in which these operations cannot be discerned. A new notion of context-sensitivity is introduced that is based on the state of the stack at any instruction. While changes in 'calling'-context are associated with transfer of control, and hence can be reasoned in terms of paths in an interprocedural control flow graph (ICFG), the same is not true of changes in 'stack'-context. An abstract interpretation based framework is developed to reason about stack-contexts and to derive analogues of call-strings based methods for the context-sensitive analysis using stack-context. The method presented is used to create a context-sensitive version of Venable et al.'s algorithm for detecting obfuscated calls. Experimental results show that the context-sensitive version of the algorithm generates more precise results and is also computationally more efficient than its context-insensitive counterpart. Copyright © 2010 ACM.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Identification and classification of overlapping nodes in networks are important topics in data mining. In this paper, a network-based (graph-based) semi-supervised learning method is proposed. It is based on competition and cooperation among walking particles in a network to uncover overlapping nodes by generating continuous-valued outputs (soft labels), corresponding to the levels of membership from the nodes to each of the communities. Moreover, the proposed method can be applied to detect overlapping data items in a data set of general form, such as a vector-based data set, once it is transformed to a network. Usually, label propagation involves risks of error amplification. In order to avoid this problem, the proposed method offers a mechanism to identify outliers among the labeled data items, and consequently prevents error propagation from such outliers. Computer simulations carried out for synthetic and real-world data sets provide a numeric quantification of the performance of the method. © 2012 Springer-Verlag.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

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

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Pós-graduação em Matematica Aplicada e Computacional - FCT

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Pós-graduação em Ciência da Computação - IBILCE