Self-similarity of complex networks and hidden metric spaces

We demonstrate that the self-similarity of some scale-free networks with respect to a simple degree-thresholding renormalization scheme finds a natural interpretation in the assumption that network nodes exist in hidden metric spaces. Clustering, i.e., cycles of length three, plays a crucial role in this framework as a topological reflection of the triangle inequality in the hidden geometry. We prove that a class of hidden variable models with underlying metric spaces are able to accurately reproduce the self-similarity properties that we measured in the real networks. Our findings indicate that hidden geometries underlying these real networks are a plausible explanation for their observed topologies and, in particular, for their self-similarity with respect to the degree-based renormalization.

Slicing the metric space to provide quick indexing of complex data in the main memory

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper. we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. (C) 2010 Elsevier B.V. All rights reserved.

Some Para-Hermitian Related Complex Structures and Non-existence of Semi-Riemannian Metric on Some Spheres

It is shown that the spheres S^(2n) (resp: S^k with k ≡ 1 mod 4) can be given neither an indefinite metric of any signature (resp: of signature (r, k − r) with 2 ≤ r ≤ k − 2) nor an almost paracomplex structure. Further for every given Riemannian metric on an almost para-Hermitian manifold with the associated 2-form φ one can construct an almost Hermitian structure (under certain conditions, two different almost Hermitian structures) whose associated 2-form(s) is φ.

Lie Groups as Four-Dimensional Special Complex Manifolds with Norden Metric

Марта Теофилова - Конструиран е пример на четиримерно специално комплексно многообразие с норденова метрика и постоянна холоморфна секционна кривина чрез двупара-метрично семейство от разрешими алгебри на Ли. Изследвани са кривинните свойства на полученото многообразие. Дадени са необходими и достатъчни усло-вия за разглежданото многообразие да бъде изотропно келерово.

Wing geometry as a tool for studying the Lutzomyia longipalpis (Diptera: Psychodidae) complex

Toro Toro (T) and Yungas (Y) have been described as genetically well differentiated populations of the Lutzomyia longipalpis (Lutz & Neiva, 1912) complex in Bolivia. Here we use geometric morphometrics to compare samples from these populations and new populations (Bolivia and Nicaragua), representing distant geographical origins, qualitative morphological variation ("one-spot" or "two-spots" phenotypes), ecologically distinct traits (peridomestic and silvatic populations), and possibly different epidemiological roles (transmitting or nor transmitting Leishmania chagasi). The Nicaragua (N) (Somotillo) sample was "one-spot" phenotype and a possible peridomestic vector. The Bolivian sample of the Y was also "one-spot" phenotype and a demonstrated peridomestic vector of visceral leishmaniasis (VL). The three remaining samples were silvatic, "two-spots" phenotypes. Two of them (Uyuni and T) were collected in the highlands of Bolivian where VL never has been reported. The last one (Robore, R) came from the lowlands of Bolivia, where human cases of VL are sporadically reported. The decomposition of metric variation into size and shape by geometric morphometric techniques suggests the existence of two groups (N/Y/R, and U/T). Several arguments indicate that such subdivision of Lu. longipalpis could correspond to different evolutionary units.

Equilibrium studies on mixed ligand complex formation of Co(II), Ni(II), Cu(II) and Zn(II) with N-(2-hydroxybenzyl)-L-histidine (H(2)hb-L-his) and typical N,N donor ligands: Crystal structure of [Ni(hb-L-his)(bipyridine)]center dot H2O complex

Equilibrium study on complex formation of Co(II), Ni(II), Cu(II) and Zn(II), hereafter M(II), with the quadridentate (O-, N, O-, N) donor ligand, N-(2-hydroxybenzyl)-L-histidine (H(2)hb-L-his, hereafter H2L), in the absence and in the presence of typical (N, N) donor bidentate ligands, 1,10 phenanthroline(phen), 2, 2'-bipyridine(bipy), ethylenediamine(en), hereafter B, in aqueous solution at 25 +/- 1 degrees C was done at a fixed ionic strength, I = 0.1 mol dm(-3) (NaNO3) by combined pH-metric, UV-Vis and EPR measurements provide evidence for the formation of mononuclear and dinuclear binary and mixed ligand complexes of the types: M(L), M(L)(2)(2-), M-2(L)(2+), M-2(H-1L)(+), M(L)(B), (B)M(H-1L)M(B)(+). The imidazole moiety of the ligand is found to act as a bridging bidentate ligand in the dinuclear M-2(L)(2+), M-2(H-1L)(+) and (B)M(H-1L)M(B)(+) complexes, using its N-3 atom and N1-H deprotonated moiety. Stability constants of the complexes provide evidence of discrimination of Cu(II) from the other M(II) ions by this ligand. Solid complexes: [Ni(L)(H2O)(2)] (1), [Cu(L)(H2O)] (2), and [Ni(L)(bipy)] (.) H2O (3) have been isolated and characterized by various physicochemical studies. Single crystal X-ray diffraction of the ternary complex, 3, shows an octahedral [(O-,N,N,O-)(N,N)] geometry with extensive pi-pi stacking of the aromatic rings and H-bonding with imidazole (N1-H), secondary amino N-atom, the lattice H2O molecule, and the carboxylate and phenolate O-atoms. (c) 2006 Elsevier B.V. All rights reserved.

How complex a dynamical network can be?

Positive Lyapunov exponents measure the asymptotic exponential divergence of nearby trajectories of a dynamical system. Not only they quantify how chaotic a dynamical system is, but since their sum is an upper bound for the rate of information production, they also provide a convenient way to quantify the complexity of a dynamical network. We conjecture based on numerical evidences that for a large class of dynamical networks composed by equal nodes, the sum of the positive Lyapunov exponents is bounded by the sum of all the positive Lyapunov exponents of both the synchronization manifold and its transversal directions, the last quantity being in principle easier to compute than the latter. As applications of our conjecture we: (i) show that a dynamical network composed of equal nodes and whose nodes are fully linearly connected produces more information than similar networks but whose nodes are connected with any other possible connecting topology; (ii) show how one can calculate upper bounds for the information production of realistic networks whose nodes have parameter mismatches, randomly chosen: (iii) discuss how to predict the behavior of a large dynamical network by knowing the information provided by a system composed of only two coupled nodes. (C) 2011 Elsevier B.V. All rights reserved.

Green chromatographic fingerprinting: An environmentally friendly approach for the development of separation methods for fingerprinting complex matrices

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

A complex networks approach for data clustering

This work proposes a method for data clustering based on complex networks theory. A data set is represented as a network by considering different metrics to establish the connection between each pair of objects. The clusters are obtained by taking into account five community detection algorithms. The network-based clustering approach is applied in two real-world databases and two sets of artificially generated data. The obtained results suggest that the exponential of the Minkowski distance is the most suitable metric to quantify the similarities between pairs of objects. In addition, the community identification method based on the greedy optimization provides the best cluster solution. We compare the network-based clustering approach with some traditional clustering algorithms and verify that it provides the lowest classification error rate. (C) 2012 Elsevier B.V. All rights reserved.

Extractive summarization using complex networks and syntactic dependency

The realization that statistical physics methods can be applied to analyze written texts represented as complex networks has led to several developments in natural language processing, including automatic summarization and evaluation of machine translation. Most importantly, so far only a few metrics of complex networks have been used and therefore there is ample opportunity to enhance the statistics-based methods as new measures of network topology and dynamics are created. In this paper, we employ for the first time the metrics betweenness, vulnerability and diversity to analyze written texts in Brazilian Portuguese. Using strategies based on diversity metrics, a better performance in automatic summarization is achieved in comparison to previous work employing complex networks. With an optimized method the Rouge score (an automatic evaluation method used in summarization) was 0.5089, which is the best value ever achieved for an extractive summarizer with statistical methods based on complex networks for Brazilian Portuguese. Furthermore, the diversity metric can detect keywords with high precision, which is why we believe it is suitable to produce good summaries. It is also shown that incorporating linguistic knowledge through a syntactic parser does enhance the performance of the automatic summarizers, as expected, but the increase in the Rouge score is only minor. These results reinforce the suitability of complex network methods for improving automatic summarizers in particular, and treating text in general. (C) 2011 Elsevier B.V. All rights reserved.

Quality Metric to Assess Video Streaming Service over TCP considering Temporal Location of Pauses

There is a wide range of video services over complex transmission networks, and in some cases end users fail to receive an acceptable quality level. In this paper, the different factors that degrade users' quality of experience (QoE) in video streaming service that use TCP as transmission protocol are studied. In this specific service, impairment factors are: number of pauses, their duration and temporal location. In order to measure the effect that each temporal segment has in the overall video quality, subjective tests. Because current subjective test methodologies are not adequate to assess video streaming over TCP, some recommendations are provided here. At the application layer, a customized player is used to evaluate the behavior of player buffer, and consequently, the end user QoE. Video subjective test results demonstrate that there is a close correlation between application parameters and subjective scores. Based on this fact, a new metrics named VsQM is defined, which considers the importance of temporal location of pauses to assess the user QoE of video streaming service. A useful application scenario is also presented, in which the metrics proposed herein is used to improve video services(1).

Decision evaluation in complex risk network systems (DecernsSDSS) demo and Black River case study

The selection of metrics for ecosystem restoration programs is critical for improving the quality of monitoring programs and characterizing project success. Moreover it is oftentimes very difficult to balance the importance of multiple ecological, social, and economical metrics. Metric selection process is a complex and must simultaneously take into account monitoring data, environmental models, socio-economic considerations, and stakeholder interests. We propose multicriteria decision analysis (MCDA) methods, broadly defined, for the selection of optimal sets of metrics to enhance evaluation of ecosystem restoration alternatives. Two MCDA methods, a multiattribute utility analysis (MAUT), and a probabilistic multicriteria acceptability analysis (ProMAA), are applied and compared for a hypothetical case study of a river restoration involving multiple stakeholders. Overall, the MCDA results in a systematic, unbiased, and transparent solution, informing restoration alternatives evaluation. The two methods provide comparable results in terms of selected metrics. However, because ProMAA can consider probability distributions for weights and utility values of metrics for each criteria, it is suggested as the best option if data uncertainty is high. Despite the increase in complexity in the metric selection process, MCDA improves upon the current ad-hoc decision practice based on the consultations with stakeholders and experts, and encourages transparent and quantitative aggregation of data and judgement, increasing the transparency of decision making in restoration projects. We believe that MCDA can enhance the overall sustainability of ecosystem by enhancing both ecological and societal needs.

Topological structures of complex belief systems

The concepts of substantive beliefs and derived beliefs are defined, a set of substantive beliefs S like open set and the neighborhood of an element substantive belief. A semantic operation of conjunction is defined with a structure of an Abelian group. Mathematical structures exist such as poset beliefs and join-semilattttice beliefs. A metric space of beliefs and the distance of belief depending on the believer are defined. The concepts of closed and opened ball are defined. S′ is defined as subgroup of the metric space of beliefs Σ and S′ is a totally limited set. The term s is defined (substantive belief) in terms of closing of S′. It is deduced that Σ is paracompact due to Stone's Theorem. The pseudometric space of beliefs is defined to show how the metric of the nonbelieving subject has a topological space like a nonmaterial abstract ideal space formed in the mind of the believing subject, fulfilling the conditions of Kuratowski axioms of closure. To establish patterns of materialization of beliefs we are going to consider that these have defined mathematical structures. This will allow us to understand better cultural processes of text, architecture, norms, and education that are forms or the materialization of an ideology. This materialization is the conversion by means of certain mathematical correspondences, of an abstract set whose elements are beliefs or ideas, in an impure set whose elements are material or energetic. Text is a materialization of ideology.

Paraconsistent Multivalued Logic and Coincidentia Oppositorum: Evaluation with Complex Numbers

Paraconsistent logic admits that the contradiction can be true. Let p be the truth values and P be a proposition. In paraconsistent logic the truth values of contradiction is . This equation has no real roots but admits complex roots . This is the result which leads to develop a multivalued logic to complex truth values. The sum of truth values being isomorphic to the vector of the plane, it is natural to relate the function V to the metric of the vector space R2. We will adopt as valuations the norms of vectors. The main objective of this paper is to establish a theory of truth-value evaluation for paraconsistent logics with the goal of using in analyzing ideological, mythical, religious and mystic belief systems.