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.

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

Cost-effectiveness analysis of universal childhood hepatitis A vaccination in Brazil: Regional analyses according to the endemic context

Objective: To To conduct a cost-effectiveness analysis of a universal childhood hepatitis A vaccination program in Brazil. Methods: An age and time-dependent dynamic model was developed to estimate the incidence of hepatitis A for 24 years. The analysis was run separately according to the pattern of regional endemicity, one for South + Southeast (low endemicity) and one for the North + Northeast + Midwest (intermediate endemicity). The decision analysis model compared universal childhood vaccination with current program of vaccinating high risk individuals. Epidemiologic and cost estimates were based on data from a nationwide seroprevalence survey of viral hepatitis, primary data collection, National Health Information Systems and literature. The analysis was conducted from both the health system and societal perspectives. Costs are expressed in 2008 Brazilian currency (Real). Results: A universal immunization program would have a significant impact on disease epidemiology in all regions, resulting in 64% reduction in the number of cases of icteric hepatitis, 59% reduction in deaths for the disease and a 62% decrease of life years lost, in a national perspective. With a vaccine price of R$16.89 (US$7.23) per dose, vaccination against hepatitis A was a cost-saving strategy in the low and intermediate endemicity regions and in Brazil as a whole from both health system and society perspective. Results were most sensitive to the frequency of icteric hepatitis, ambulatory care and vaccine costs. Conclusions: Universal childhood vaccination program against hepatitis A could be a cost-saving strategy in all regions of Brazil. These results are useful for the Brazilian government for vaccine related decisions and for monitoring population impact if the vaccine is included in the National Immunization Program. (C) 2012 Elsevier Ltd. All rights reserved.

On universal Banach spaces of density continuum

We consider the question whether there exists a Banach space X of density continuum such that every Banach space of density at most continuum isomorphically embeds into X (called a universal Banach space of density c). It is well known that a""(a)/c (0) is such a space if we assume the continuum hypothesis. Some additional set-theoretic assumption is indeed needed, as we prove in the main result of this paper that it is consistent with the usual axioms of set-theory that there is no universal Banach space of density c. Thus, the problem of the existence of a universal Banach space of density c is undecidable using the usual axioms of set-theory. We also prove that it is consistent that there are universal Banach spaces of density c, but a""(a)/c (0) is not among them. This relies on the proof of the consistency of the nonexistence of an isomorphic embedding of C([0, c]) into a""(a)/c (0).

Rationale and knowledge for the universal implementation of sanitation in areas of social vulnerability

The adoption of principles of equality and universality stipulated in legislation for the sanitation sector requires discussions on innovation. The existing model was able to meet sanitary demands, but was unable to attend all areas causing disparities in vulnerable areas. The universal implementation of sanitation requires identification of the know-how that promotes it and analysis of the model adopted today to establish a new method. Analysis of how different viewpoints on the restructuring process is necessary for the definition of public policy, especially in health, and understanding its complexities and importance in confirming social practices and organizational designs. These are discussed to contribute to universal implementation of sanitation in urban areas by means of a review of the literature and practices in the industry. By way of conclusion, it is considered that accepting a particular concept or idea in sanitation means choosing some effective interventions in the network and on the lives of individual users, and implies a redefinition of the space in which it exercises control and management of sewerage networks, such that connected users are perceived as groups with different interests.

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.

Dilthey: The hermeneutics of life and the universal aspirations of pedagogy

Dilthey claimed that first psychology and then hermeneutics played the foundational role for his philosophy of life, whose main practical goal is to develop a pedagogy or theory of education. Pedagogy needs help from h ethics to establish its ends, and from psychology to indicate it means. This paper intends to show the relationship between Dilthey's hermeneutics of life and his pedagogy. Dilthey's philosophy of life, in so far it adopts the hermeneutical procedure, engages in the understanding of or the search for the meaning of human socio-historical creations, by adopting a special type of relationship between parts and whole. It is exactly within this hermeneutical balance that we propose to extinguish any indication of a rupture, breach, or contradiction between the quest for universal principles of human behavior and :Dilthey's defense of the impossibility of constructing human moral tasks by means of universal principles. Dilthey began his ethics lectures at the University of Berlin in 1890. These lectures, published in 1958 by Herman Nohl in volume X of Dilthey's collected works, indicate the direction of the trajectory by which formative or social ethics are consolidated as a historical solution for reaching universal principles that can guide human purposes. This trajectory is a result of the distinctively human exercise of self-reflection, by means of which we can fulfill our destiny of manifesting and exteriorizing in time the immanent energy of the absolute spirit. We wish to show that it is possible that such a pedagogy can respect its universal task of orienting the historical development of the younger generation without directing this process by means of fixed and rigid aims.

Cost-effectiveness of introducing the 10-valent pneumococcal conjugate vaccine into the universal immunisation of infants in Brazil

Background Cost-effectiveness studies have been increasingly part of decision processes for incorporating new vaccines into the Brazilian National Immunisation Program. This study aimed to evaluate the cost-effectiveness of 10-valent pneumococcal conjugate vaccine (PCV10) in the universal childhood immunisation programme in Brazil. Methods A decision-tree analytical model based on the ProVac Initiative pneumococcus model was used, following 25 successive cohorts from birth until 5 years of age. Two strategies were compared: (1) status quo and (2) universal childhood immunisation programme with PCV10. Epidemiological and cost estimates for pneumococcal disease were based on National Health Information Systems and literature. A 'top-down' costing approach was employed. Costs are reported in 2004 Brazilian reals. Costs and benefits were discounted at 3%. Results 25 years after implementing the PCV10 immunisation programme, 10 226 deaths, 360 657 disability-adjusted life years (DALYs), 433 808 hospitalisations and 5 117 109 outpatient visits would be avoided. The cost of the immunisation programme would be R$10 674 478 765, and the expected savings on direct medical costs and family costs would be R$1 036 958 639 and R$209 919 404, respectively. This resulted in an incremental cost-effectiveness ratio of R$778 145/death avoided and R$22 066/DALY avoided from the society perspective. Conclusion The PCV10 universal infant immunisation programme is a cost-effective intervention (1-3 GDP per capita/DALY avoided). Owing to the uncertain burden of disease data, as well as unclear long-term vaccine effects, surveillance systems to monitor the long-term effects of this programme will be essential.

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.

Universal behavior of the Shannon mutual information of critical quantum chains

We consider the Shannon mutual information of subsystems of critical quantum chains in their ground states. Our results indicate a universal leading behavior for large subsystem sizes. Moreover, as happens with the entanglement entropy, its finite-size behavior yields the conformal anomaly c of the underlying conformal field theory governing the long-distance physics of the quantum chain. We study analytically a chain of coupled harmonic oscillators and numerically the Q-state Potts models (Q = 2, 3, and 4), the XXZ quantum chain, and the spin-1 Fateev-Zamolodchikov model. The Shannon mutual information is a quantity easily computed, and our results indicate that for relatively small lattice sizes, its finite-size behavior already detects the universality class of quantum critical behavior.