Métodos numéricos para encontrar zeros de funções: aplicações para o Ensino Médio

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

Degradação dos fármacos ciprofloxacino e sertalina pelos processos ferro zero e foto-Fenton - aplicação em amostras de efluentes de estação de tratamento de esgoto

Pós-graduação em Química - IQ

Zero sets of bivariate Hermite polynomials

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

On the effects of mistuning a force-excited system containing a quasi-zero-stiffness vibration isolator

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

A new family of zero-current-switching PWM converters and a novel HPF-ZCS-PWM boost rectifier

A new family of direct current (DC) to DC converters based on a zero current switching pulse width modulated (ZCS-PWM) soft commutation cell is presented. This ZCS-PWM cell is consists of two transistors, two diodes, two inductors and one capacitor; and provides zero voltage turn-on to the diodes, a zero-current turn-on and a zero-current zero-voltage turn-off to the transistors. In addition, a new commutation cell in a new ZCS-PWM boost rectifier is developed, obtaining a structure with power factor near the unity, high efficiency at wide load range and low total harmonic distortion in the input current.

Comparação de custo do milho fertilizado com adubo industrial e com lodo de esgoto a custo zero

In this study, we compared the production cost of summer corn growing in soils treated with industrial fertilizer with those grown treated with sewage sludge. Corn was cultivated on reduced tillage treatment during 2002/2003 in an Oxisol area of 0.0625 hec. The field trial with industrial fertilizer was conducted following related guidelines for the state of Sao Paulo. The application of sewage sludge to the soil was at the rate of 10 t.ha-1. Calculations were based on market prices for the abovementioned years. In addition to lower environmental impact, results indicate economic cost advantages associated with the use of sewage sludge.

Space–time zero-inflated count models of Harbor seals

Environmental data are spatial, temporal, and often come with many zeros. In this paper, we included space–time random effects in zero-inflated Poisson (ZIP) and ‘hurdle’ models to investigate haulout patterns of harbor seals on glacial ice. The data consisted of counts, for 18 dates on a lattice grid of samples, of harbor seals hauled out on glacial ice in Disenchantment Bay, near Yakutat, Alaska. A hurdle model is similar to a ZIP model except it does not mix zeros from the binary and count processes. Both models can be used for zero-inflated data, and we compared space–time ZIP and hurdle models in a Bayesian hierarchical model. Space–time ZIP and hurdle models were constructed by using spatial conditional autoregressive (CAR) models and temporal first-order autoregressive (AR(1)) models as random effects in ZIP and hurdle regression models. We created maps of smoothed predictions for harbor seal counts based on ice density, other covariates, and spatio-temporal random effects. For both models predictions around the edges appeared to be positively biased. The linex loss function is an asymmetric loss function that penalizes overprediction more than underprediction, and we used it to correct for prediction bias to get the best map for space–time ZIP and hurdle models.

Discriminating Different Classes of Biological Networks by Analyzing the Graphs Spectra Distribution

The brain's structural and functional systems, protein-protein interaction, and gene networks are examples of biological systems that share some features of complex networks, such as highly connected nodes, modularity, and small-world topology. Recent studies indicate that some pathologies present topological network alterations relative to norms seen in the general population. Therefore, methods to discriminate the processes that generate the different classes of networks (e. g., normal and disease) might be crucial for the diagnosis, prognosis, and treatment of the disease. It is known that several topological properties of a network (graph) can be described by the distribution of the spectrum of its adjacency matrix. Moreover, large networks generated by the same random process have the same spectrum distribution, allowing us to use it as a "fingerprint". Based on this relationship, we introduce and propose the entropy of a graph spectrum to measure the "uncertainty" of a random graph and the Kullback-Leibler and Jensen-Shannon divergences between graph spectra to compare networks. We also introduce general methods for model selection and network model parameter estimation, as well as a statistical procedure to test the nullity of divergence between two classes of complex networks. Finally, we demonstrate the usefulness of the proposed methods by applying them to (1) protein-protein interaction networks of different species and (2) on networks derived from children diagnosed with Attention Deficit Hyperactivity Disorder (ADHD) and typically developing children. We conclude that scale-free networks best describe all the protein-protein interactions. Also, we show that our proposed measures succeeded in the identification of topological changes in the network while other commonly used measures (number of edges, clustering coefficient, average path length) failed.

Properly coloured copies and rainbow copies of large graphs with small maximum degree

Let G be a graph on n vertices with maximum degree ?. We use the Lovasz local lemma to show the following two results about colourings ? of the edges of the complete graph Kn. If for each vertex v of Kn the colouring ? assigns each colour to at most (n - 2)/(22.4?2) edges emanating from v, then there is a copy of G in Kn which is properly edge-coloured by ?. This improves on a result of Alon, Jiang, Miller, and Pritikin [Random Struct. Algorithms 23(4), 409433, 2003]. On the other hand, if ? assigns each colour to at most n/(51?2) edges of Kn, then there is a copy of G in Kn such that each edge of G receives a different colour from ?. This proves a conjecture of Frieze and Krivelevich [Electron. J. Comb. 15(1), R59, 2008]. Our proofs rely on a framework developed by Lu and Szekely [Electron. J. Comb. 14(1), R63, 2007] for applying the local lemma to random injections. In order to improve the constants in our results we use a version of the local lemma due to Bissacot, Fernandez, Procacci, and Scoppola [preprint, arXiv:0910.1824]. (c) 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 425436, 2012

Supersymmetric Isospectral Formalism for the Calculation of Near-Zero Energy States: Application to the Very Weakly Bound He-4 Trimer Excited State

We propose a novel mathematical approach for the calculation of near-zero energy states by solving potentials which are isospectral with the original one. For any potential, families of strictly isospectral potentials (with very different shape) having desirable and adjustable features are generated by supersymmetric isospectral formalism. The near-zero energy Efimov state in the original potential is effectively trapped in the deep well of the isospectral family and facilitates more accurate calculation of the Efimov state. Application to the first excited state in He-4 trimer is presented.

Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size

Let k and l be positive integers. With a graph G, we associate the quantity c(k,l)(G), the number of k-colourings of the edge set of G with no monochromatic matching of size l. Consider the function c(k,l) : N --> N given by c(k,l)(n) = max {c(k,l)(G): vertical bar V(G)vertical bar = n}, the maximum of c(k,l)(G) over all graphs G on n vertices. In this paper, we determine c(k,l)(n) and the corresponding extremal graphs for all large n and all fixed values of k and l.

Harmonic deformation of Delaunay triangulations

We construct harmonic functions on random graphs given by Delaunay triangulations of ergodic point processes as the limit of the zero-temperature harness process. (C) 2012 Elsevier B.V All rights reserved.

TYPE-ZERO SADDLE-NODE BIFURCATIONS AND STABILITY REGION ESTIMATION OF NONLINEAR AUTONOMOUS DYNAMICAL SYSTEMS

A complete characterization of the stability boundary of a class of nonlinear dynamical systems that admit energy functions is developed in this paper. This characterization generalizes the existing results by allowing the type-zero saddle-node nonhyperbolic equilibrium points on the stability boundary. Conceptual algorithms to obtain optimal estimates of the stability region (basin of attraction) in the form of level sets of a given family of energy functions are derived. The behavior of the stability region and the corresponding estimates are investigated for parameter variation in the neighborhood of a type-zero saddle-node bifurcation value.

UNIVERSALITY OF RANDOM GRAPHS

We prove that asymptotically (as n -> infinity) almost all graphs with n vertices and C(d)n(2-1/2d) log(1/d) n edges are universal with respect to the family of all graphs with maximum degree bounded by d. Moreover, we provide an efficient deterministic embedding algorithm for finding copies of bounded degree graphs in graphs satisfying certain pseudorandom properties. We also prove a counterpart result for random bipartite graphs, where the threshold number of edges is even smaller but the embedding is randomized.

Speech Graphs Provide a Quantitative Measure of Thought Disorder in Psychosis

Background: Psychosis has various causes, including mania and schizophrenia. Since the differential diagnosis of psychosis is exclusively based on subjective assessments of oral interviews with patients, an objective quantification of the speech disturbances that characterize mania and schizophrenia is in order. In principle, such quantification could be achieved by the analysis of speech graphs. A graph represents a network with nodes connected by edges; in speech graphs, nodes correspond to words and edges correspond to semantic and grammatical relationships. Methodology/Principal Findings: To quantify speech differences related to psychosis, interviews with schizophrenics, manics and normal subjects were recorded and represented as graphs. Manics scored significantly higher than schizophrenics in ten graph measures. Psychopathological symptoms such as logorrhea, poor speech, and flight of thoughts were grasped by the analysis even when verbosity differences were discounted. Binary classifiers based on speech graph measures sorted schizophrenics from manics with up to 93.8% of sensitivity and 93.7% of specificity. In contrast, sorting based on the scores of two standard psychiatric scales (BPRS and PANSS) reached only 62.5% of sensitivity and specificity. Conclusions/Significance: The results demonstrate that alterations of the thought process manifested in the speech of psychotic patients can be objectively measured using graph-theoretical tools, developed to capture specific features of the normal and dysfunctional flow of thought, such as divergence and recurrence. The quantitative analysis of speech graphs is not redundant with standard psychometric scales but rather complementary, as it yields a very accurate sorting of schizophrenics and manics. Overall, the results point to automated psychiatric diagnosis based not on what is said, but on how it is said.