15 resultados para Integral Graph

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo


Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper addresses the functional reliability and the complexity of reconfigurable antennas using graph models. The correlation between complexity and reliability for any given reconfigurable antenna is defined. Two methods are proposed to reduce failures and improve the reliability of reconfigurable antennas. The failures are caused by the reconfiguration technique or by the surrounding environment. These failure reduction methods proposed are tested and examples are given which verify these methods.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Sznajd model is a sociophysics model that is used to model opinion propagation and consensus formation in societies. Its main feature is that its rules favor bigger groups of agreeing people. In a previous work, we generalized the bounded confidence rule in order to model biases and prejudices in discrete opinion models. In that work, we applied this modification to the Sznajd model and presented some preliminary results. The present work extends what we did in that paper. We present results linking many of the properties of the mean-field fixed points, with only a few qualitative aspects of the confidence rule (the biases and prejudices modeled), finding an interesting connection with graph theory problems. More precisely, we link the existence of fixed points with the notion of strongly connected graphs and the stability of fixed points with the problem of finding the maximal independent sets of a graph. We state these results and present comparisons between the mean field and simulations in Barabasi-Albert networks, followed by the main mathematical ideas and appendices with the rigorous proofs of our claims and some graph theory concepts, together with examples. We also show that there is no qualitative difference in the mean-field results if we require that a group of size q > 2, instead of a pair, of agreeing agents be formed before they attempt to convince other sites (for the mean field, this would coincide with the q-voter model).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This study examines the paramilitary training carried out by the Integralist Militia (Militia Integralista), unit of the Brazilian Integralist Action (Acao Integralista Brasileira, AIB) of the extreme right wing political party in Brazil in the 1930s. The training was aimed to create the "integral soldier", a "physically strong, intelligent and soul superior" one. The study analyzes issues of the newspaper "Monitor Integralista", a prescriptive and dogmatic journal of the movement, found in the Public and History Archives of the city of Rio Claro, State of Sao Paulo, and in the "A Offensiva" newspaper, microfilmed an archived at the National Library of Rio de Janeiro. It concludes that Plinio Salgado's goal, the National Head of the AIB, was to train, by using verbal persuasion, speeches, word of mouth and by vote, by force and physical combat, the integralists to defend the causes of the movement.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A deep theoretical analysis of the graph cut image segmentation framework presented in this paper simultaneously translates into important contributions in several directions. The most important practical contribution of this work is a full theoretical description, and implementation, of a novel powerful segmentation algorithm, GC(max). The output of GC(max) coincides with a version of a segmentation algorithm known as Iterative Relative Fuzzy Connectedness, IRFC. However, GC(max) is considerably faster than the classic IRFC algorithm, which we prove theoretically and show experimentally. Specifically, we prove that, in the worst case scenario, the GC(max) algorithm runs in linear time with respect to the variable M=|C|+|Z|, where |C| is the image scene size and |Z| is the size of the allowable range, Z, of the associated weight/affinity function. For most implementations, Z is identical to the set of allowable image intensity values, and its size can be treated as small with respect to |C|, meaning that O(M)=O(|C|). In such a situation, GC(max) runs in linear time with respect to the image size |C|. We show that the output of GC(max) constitutes a solution of a graph cut energy minimization problem, in which the energy is defined as the a"" (a) norm ayenF (P) ayen(a) of the map F (P) that associates, with every element e from the boundary of an object P, its weight w(e). This formulation brings IRFC algorithms to the realm of the graph cut energy minimizers, with energy functions ayenF (P) ayen (q) for qa[1,a]. Of these, the best known minimization problem is for the energy ayenF (P) ayen(1), which is solved by the classic min-cut/max-flow algorithm, referred to often as the Graph Cut algorithm. We notice that a minimization problem for ayenF (P) ayen (q) , qa[1,a), is identical to that for ayenF (P) ayen(1), when the original weight function w is replaced by w (q) . Thus, any algorithm GC(sum) solving the ayenF (P) ayen(1) minimization problem, solves also one for ayenF (P) ayen (q) with qa[1,a), so just two algorithms, GC(sum) and GC(max), are enough to solve all ayenF (P) ayen (q) -minimization problems. We also show that, for any fixed weight assignment, the solutions of the ayenF (P) ayen (q) -minimization problems converge to a solution of the ayenF (P) ayen(a)-minimization problem (ayenF (P) ayen(a)=lim (q -> a)ayenF (P) ayen (q) is not enough to deduce that). An experimental comparison of the performance of GC(max) and GC(sum) algorithms is included. This concentrates on comparing the actual (as opposed to provable worst scenario) algorithms' running time, as well as the influence of the choice of the seeds on the output.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present a method of generation of exact and explicit forms of one-sided, heavy-tailed Levy stable probability distributions g(alpha)(x), 0 <= x < infinity, 0 < alpha < 1. We demonstrate that the knowledge of one such a distribution g a ( x) suffices to obtain exactly g(alpha)p ( x), p = 2, 3, .... Similarly, from known g(alpha)(x) and g(beta)(x), 0 < alpha, beta < 1, we obtain g(alpha beta)( x). The method is based on the construction of the integral operator, called Levy transform, which implements the above operations. For a rational, alpha = l/k with l < k, we reproduce in this manner many of the recently obtained exact results for g(l/k)(x). This approach can be also recast as an application of the Efros theorem for generalized Laplace convolutions. It relies solely on efficient definite integration. (C) 2012 American Institute of Physics. [http://dx.doi.org/10.1063/1.4709443]

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The method of steepest descent is used to study the integral kernel of a family of normal random matrix ensembles with eigenvalue distribution P-N (z(1), ... , z(N)) = Z(N)(-1)e(-N)Sigma(N)(i=1) V-alpha(z(i)) Pi(1 <= i<j <= N) vertical bar z(i) - z(j)vertical bar(2), where V-alpha(z) = vertical bar z vertical bar(alpha), z epsilon C and alpha epsilon inverted left perpendicular0, infinity inverted right perpendicular. Asymptotic formulas with error estimate on sectors are obtained. A corollary of these expansions is a scaling limit for the n-point function in terms of the integral kernel for the classical Segal-Bargmann space. (C) 2012 American Institute of Physics. [http://dx.doi.org/10.1063/1.3688293]

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, a new algebraic-graph method for identification of islanding in power system grids is proposed. The proposed method identifies all the possible cases of islanding, due to the loss of a equipment, by means of a factorization of the bus-branch incidence matrix. The main features of this new method include: (i) simple implementation, (ii) high speed, (iii) real-time adaptability, (iv) identification of all islanding cases and (v) identification of the buses that compose each island in case of island formation. The method was successfully tested on large-scale systems such as the reduced south Brazilian system (45 buses/72 branches) and the south-southeast Brazilian system (810 buses/1340 branches). (C) 2011 Elsevier Ltd. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we introduce a new class of abstract integral equations which enables us to study in a unified manner several different types of differential equations. (C) 2012 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Despite the fact that the integral form of the equations of classical electrodynamics is well known, the same is not true for non-Abelian gauge theories. The aim of the present paper is threefold. First, we present the integral form of the classical Yang-Mills equations in the presence of sources and then use it to solve the long-standing problem of constructing conserved charges, for any field configuration, which are invariant under general gauge transformations and not only under transformations that go to a constant at spatial infinity. The construction is based on concepts in loop spaces and on a generalization of the non-Abelian Stokes theorem for two-form connections. The third goal of the paper is to present the integral form of the self-dual Yang-Mills equations and calculate the conserved charges associated with them. The charges are explicitly evaluated for the cases of monopoles, dyons, instantons and merons, and we show that in many cases those charges must be quantized. Our results are important in the understanding of global properties of non-Abelian gauge theories.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Our objective here is to prove that the uniform convergence of a sequence of Kurzweil integrable functions implies the convergence of the sequence formed by its corresponding integrals.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We deal with the optimization of the production of branched sheet metal products. New forming techniques for sheet metal give rise to a wide variety of possible profiles and possible ways of production. In particular, we show how the problem of producing a given profile geometry can be modeled as a discrete optimization problem. We provide a theoretical analysis of the model in order to improve its solution time. In this context we give the complete convex hull description of some substructures of the underlying polyhedron. Moreover, we introduce a new class of facet-defining inequalities that represent connectivity constraints for the profile and show how these inequalities can be separated in polynomial time. Finally, we present numerical results for various test instances, both real-world and academic examples.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We measured the K-41 thermal neutron absorption and resonance integral cross sections after the irradiation of KNO3 samples near the core of the IEA-R1 IPEN pool-type research reactor. Bare and cadmium-covered targets were irradiated in pairs with Au-Al alloy flux-monitors. The residual activities were measured by gamma-ray spectroscopy with a HPGe detector, with special care to avoid the K-42 decay beta(-) emission effects on the spectra. The gamma-ray self-absorption was corrected with the help of MCNP simulations. We applied the Westcott formalism in the average neutron flux determination and calculated the depression coefficients for thermal and epithermal neutrons due to the sample thickness with analytical approximations. We obtained 1.57(4) and 1.02(4) b, for thermal and resonance integral cross sections, respectively, with correlation coefficient equal to 0.39.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Abstract Background Recently, it was realized that the functional connectivity networks estimated from actual brain-imaging technologies (MEG, fMRI and EEG) can be analyzed by means of the graph theory, that is a mathematical representation of a network, which is essentially reduced to nodes and connections between them. Methods We used high-resolution EEG technology to enhance the poor spatial information of the EEG activity on the scalp and it gives a measure of the electrical activity on the cortical surface. Afterwards, we used the Directed Transfer Function (DTF) that is a multivariate spectral measure for the estimation of the directional influences between any given pair of channels in a multivariate dataset. Finally, a graph theoretical approach was used to model the brain networks as graphs. These methods were used to analyze the structure of cortical connectivity during the attempt to move a paralyzed limb in a group (N=5) of spinal cord injured patients and during the movement execution in a group (N=5) of healthy subjects. Results Analysis performed on the cortical networks estimated from the group of normal and SCI patients revealed that both groups present few nodes with a high out-degree value (i.e. outgoing links). This property is valid in the networks estimated for all the frequency bands investigated. In particular, cingulate motor areas (CMAs) ROIs act as ‘‘hubs’’ for the outflow of information in both groups, SCI and healthy. Results also suggest that spinal cord injuries affect the functional architecture of the cortical network sub-serving the volition of motor acts mainly in its local feature property. In particular, a higher local efficiency El can be observed in the SCI patients for three frequency bands, theta (3-6 Hz), alpha (7-12 Hz) and beta (13-29 Hz). By taking into account all the possible pathways between different ROI couples, we were able to separate clearly the network properties of the SCI group from the CTRL group. In particular, we report a sort of compensatory mechanism in the SCI patients for the Theta (3-6 Hz) frequency band, indicating a higher level of “activation” Ω within the cortical network during the motor task. The activation index is directly related to diffusion, a type of dynamics that underlies several biological systems including possible spreading of neuronal activation across several cortical regions. Conclusions The present study aims at demonstrating the possible applications of graph theoretical approaches in the analyses of brain functional connectivity from EEG signals. In particular, the methodological aspects of the i) cortical activity from scalp EEG signals, ii) functional connectivity estimations iii) graph theoretical indexes are emphasized in the present paper to show their impact in a real application.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Apesar dos benefícios nutricionais e de seu potencial como alimento funcional, o amaranto ainda é um alimento pouco difundido no Brasil. Para o aumento do consumo desta matéria-prima, preconiza-se a sua incorporação na formulação de produtos convencionais, como os snacks extrudados que vêm sendo elaborados com a farinha de amaranto desengordurada. Pouco tem sido pesquisado sobre a extrusão direta do grão integral de amaranto, o que permitiria eliminar as etapas de moagem e de desengorduramento. Assim, a pesquisa avaliou e comparou a qualidade tecnológica de snacks obtidos por extrusão de grão integral de amaranto e de farinha de amaranto desengordurada, e suas misturas com 25 e 50% de fubá de milho. Verificou-se que o teor de lipídeos presentes no grão de amaranto (8%) prejudicou a expansão e a textura dos extrudados. Mesmo com a adição de fubá de milho, os snacks extrudados à base de grão integral de amaranto foram rejeitados sensorialmente (aceitação global entre 3 e 4, numa escala hedônica estruturada de nove pontos), pois apresentaram baixa expansão, textura dura, cor escura e forte sabor residual. Já os snacks extrudados obtidos com farinha de amaranto desengordurada isoladamente e em combinação com fubá de milho apresentaram maior expansão, textura crocante e cor mais clara, e, por isso, maior aceitabilidade (aceitação global > 5). Conclui-se, nas condições do experimento, que não foi possível obter snacks extrudados à base de grãos de amaranto de boa aceitação e que a produção de snacks extrudados à base de farinha de amaranto desengordurada proporciona produtos com melhor aceitação por parte do consumidor.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We obtain explicit formulas for the eigenvalues of integral operators generated by continuous dot product kernels defined on the sphere via the usual gamma function. Using them, we present both, a procedure to describe sharp bounds for the eigenvalues and their asymptotic behavior near 0. We illustrate our results with examples, among them the integral operator generated by a Gaussian kernel. Finally, we sketch complex versions of our results to cover the cases when the sphere sits in a Hermitian space.