Instabilities in thermal gravity with a cosmological constant

It is shown that in quantum gravity at finite temperature, the effective potential evaluated in the tadpole approximation can have a local minimum below a certain critical temperature. However, when the leading higher order thermal loop corrections are included, one finds that no static solution exists at high temperature. (C) 2008 Elsevier B.V. All rights reserved.

Algoritomos transgenéticos aplicados ao problema da árvore geradora biobjetivo

The Multiobjective Spanning Tree is a NP-hard Combinatorial Optimization problem whose application arises in several areas, especially networks design. In this work, we propose a solution to the biobjective version of the problem through a Transgenetic Algorithm named ATIS-NP. The Computational Transgenetic is a metaheuristic technique from Evolutionary Computation whose inspiration relies in the conception of cooperation (and not competition) as the factor of main influence to evolution. The algorithm outlined is the evolution of a work that has already yielded two other transgenetic algorithms. In this sense, the algorithms previously developed are also presented. This research also comprises an experimental analysis with the aim of obtaining information related to the performance of ATIS-NP when compared to other approaches. Thus, ATIS-NP is compared to the algorithms previously implemented and to other transgenetic already presented for the problem under consideration. The computational experiments also address the comparison to two recent approaches from literature that present good results, a GRASP and a genetic algorithms. The efficiency of the method described is evaluated with basis in metrics of solution quality and computational time spent. Considering the problem is within the context of Multiobjective Optimization, quality indicators are adopted to infer the criteria of solution quality. Statistical tests evaluate the significance of results obtained from computational experiments

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

Neural networks training using the constructivism paradigms

The Backpropagation Algorithm (BA) is the standard method for training multilayer Artificial Neural Networks (ANN), although it converges very slowly and can stop in a local minimum. We present a new method for neural network training using the BA inspired on constructivism, an alphabetization method proposed by Emilia Ferreiro based on Piaget philosophy. Simulation results show that the proposed configuration usually obtains a lower final mean square error, when compared with the standard BA and with the BA with momentum factor.

Speeding up optimum-path forest training by path-cost propagation

In this paper we present an optimization of the Optimum-Path Forest classifier training procedure, which is based on a theoretical relationship between minimum spanning forest and optimum-path forest for a specific path-cost function. Experiments on public datasets have shown that the proposed approach can obtain similar accuracy to the traditional one but with faster data training. © 2012 ICPR Org Committee.

Desenvolvimento de um sistema dinâmico para predição de cargas elétricas por redes neurais através do paradigma de programação orientada a objeto sob a linguagem JAVA

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

Evaluation of ERIC-PCR as Genotyping Method for Corynebacterium pseudotuberculosis Isolates

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

Non-perturbative fixed points and renormalization group improved effective potential

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

Método primal-dual previsor-corretor de pontos interiores e exteriores com estratégias de correção de inércia e suavização hiperbólica aplicado ao problema de despacho econômico com ponto de carregamento de válvula e representação da transmissão

Pós-graduação em Engenharia Elétrica - FEB

Interações entre pré-escolares: possibilidades de análises

Buscou-se, neste trabalho, construir a rede de relações sociais entre pré-escolares e analisar a pertinência das metodologias utilizadas para a coleta e análise dos dados. Participaram dezessete pré-escolares de uma escola privada em Belém-PA. Os dados foram coletados através de teste sociométrico e observação comportamental. A estrutura do grupo foi analisada a partir da rede de relações sociais, construída através de Árvores Geradoras Mínimas (Teoria dos Grafos). Os resultados mostraram preferências por parcerias diferentes no teste sociométrico e no comportamento interativo. As duas medidas complementaram-se. O uso da Teoria dos Grafos demonstrou-se relevante por possibilitar análises quantitativa e qualitativa do fenômeno social.

Dados espectroscópicos de diterpenos labdânicos: uma análise teórica via RMN e DFT

Labdane diterpenes exhibit important bioactivities such as cardiovascular effects in rats as well as effects in the treatment of autoimmune diseases and Alzheimer syndrome. Recently, the labdane diterpenes ent-13-epi-manoil oxide, ribenone and ribenol were isolated from Croton palanostigma. The computational method DFT/B3LYP/cc-pVDZ was used to optimize the structures of these diterpenes and to calculate infrared data. Chemical shifts (δ_H and δ_C) of the minimum energy structures (local minimum) were calculated and compared with the experimental data. Comparison of the NMR data by simple linear regression (SLR) showed satisfactory statistical results with a correlation coefficient (R²) and predictive ability (Q²) of over 98%. The predicted NMR data were used to confirm the δ_H values that have not been published.

Genetic variability and demographic history of Heliothis virescens (Lepidoptera: Noctuidae) populations from Brazil inferred by mtDNA sequences

Intra-and inter-population genetic variability and the demographic history of Heliothis virescens (F.) populations were evaluated by using mtDNA markers (coxI, coxII and nad6) with samples from the major cotton-and soybean-producing regions in Brazil in the growing seasons 2007/08, 2008/09 and 2009/10. AMOVA indicated low and non-significant genetic structure, regardless of geographical scale, growing season or crop, with most of genetic variation occurring within populations. Clustering analyzes also indicated low genetic differentiation. The haplotype network obtained with combined datasets resulted in 35 haplotypes, with 28 exclusive occurrences, four of them sampled only from soybean fields. The minimum spanning network showed star-shaped structures typical of populations that underwent a recent demographic expansion. The recent expansion was supported by other demographic analyzes, such as the Bayesian skyline plot, the unimodal distribution of paired differences among mitochondrial sequences, and negative and significant values of neutrality tests for the Tajima's D and Fu's F-S parameters. In addition, high values of haplotype diversity ((H) over cap) and low values of nucleotide diversity (pi), combined with a high number of low frequency haplotypes and values of theta(pi)<theta(W), suggested a recent demographic expansion of H. virescens populations in Brazil. This demographic event could be responsible for the low genetic structure currently found; however, haplotypes present uniquely at the same geographic regions and from one specific host plant suggest an initial differentiation among H. virescens populations within Brazil.

Maximum Series-Parallel Subgraph

Consider the NP-hard problem of, given a simple graph G, to find a series-parallel subgraph of G with the maximum number of edges. The algorithm that, given a connected graph G, outputs a spanning tree of G, is a 1/2-approximation. Indeed, if n is the number of vertices in G, any spanning tree in G has n-1 edges and any series-parallel graph on n vertices has at most 2n-3 edges. We present a 7/12 -approximation for this problem and results showing the limits of our approach.

Analog circuit synthesis performing fast Pareto frontier exploration and analysis through 3D graphs

This paper presents a technique for performing analog design synthesis at circuit level providing feedback to the designer through the exploration of the Pareto frontier. A modified simulated annealing which is able to perform crossover with past anchor points when a local minimum is found which is used as the optimization algorithm on the initial synthesis procedure. After all specifications are met, the algorithm searches for the extreme points of the Pareto frontier in order to obtain a non-exhaustive exploration of the Pareto front. Finally, multi-objective particle swarm optimization is used to spread the results and to find a more accurate frontier. Piecewise linear functions are used as single-objective cost functions to produce a smooth and equal convergence of all measurements to the desired specifications during the composition of the aggregate objective function. To verify the presented technique two circuits were designed, which are: a Miller amplifier with 96 dB Voltage gain, 15.48 MHz unity gain frequency, slew rate of 19.2 V/mu s with a current supply of 385.15 mu A, and a complementary folded cascode with 104.25 dB Voltage gain, 18.15 MHz of unity gain frequency and a slew rate of 13.370 MV/mu s. These circuits were synthesized using a 0.35 mu m technology. The results show that the method provides a fast approach for good solutions using the modified SA and further good Pareto front exploration through its connection to the particle swarm optimization algorithm.

Dynamic texture segmentation based on deterministic partially self-avoiding walks

Recently there has been a considerable interest in dynamic textures due to the explosive growth of multimedia databases. In addition, dynamic texture appears in a wide range of videos, which makes it very important in applications concerning to model physical phenomena. Thus, dynamic textures have emerged as a new field of investigation that extends the static or spatial textures to the spatio-temporal domain. In this paper, we propose a novel approach for dynamic texture segmentation based on automata theory and k-means algorithm. In this approach, a feature vector is extracted for each pixel by applying deterministic partially self-avoiding walks on three orthogonal planes of the video. Then, these feature vectors are clustered by the well-known k-means algorithm. Although the k-means algorithm has shown interesting results, it only ensures its convergence to a local minimum, which affects the final result of segmentation. In order to overcome this drawback, we compare six methods of initialization of the k-means. The experimental results have demonstrated the effectiveness of our proposed approach compared to the state-of-the-art segmentation methods.