Reciprocidade periférica como estratégia para aumento de centralidade: estudo de rede de citações acadêmicas

Esta tese apresenta uma configuração em que, numa rede social regida pelo princípio da ligação preferencial, nós periféricos buscam inflacionar artificialmente seus índices de centralidade, medida pelo grau de entrada, por meio do privilégio temporário da reciprocidade de ligações com outros nós periféricos. Para construir este cenário, criou-se uma rede com as características de uma rede acadêmica de citações entre artigos, em que os nós são artigos publicados por um conjunto de periódicos, e as ligações entre eles são as citações que cada artigo faz a outros artigos existentes. Esta rede foi condensada em outra, na qual os nós são os periódicos aos quais cada artigo da primeira rede está associado, e as ligações são o total de citações que os artigos de um periódico faz aos artigos de cada outro periódico. Implementou-se um método de simulação computacional, no qual, durante alguns ciclos, foram manipulados parâmetros relacionados à quantidade total de ligações (citações) entre periódicos periféricos, de forma a induzir os efeitos desejados de reciprocidade periférica, alterando a lógica de direcionamento de citações pela atribuição de maior probabilidade para que artigos de outros periódicos periféricos recebessem ligações, afastando-se da lógica da ligação preferencial, porém sem alterar qualquer outra característica intrínseca que representasse a capacidade de um artigo ou periódico atrair novas ligações. Chamou-se esta alteração da lógica de alocação de ligações entre periódicos periféricos de Comportamento Estratégico. Observou-se que o Comportamento Estratégico é capaz de trazer benefícios de centralidade medida por grau para aqueles periódicos em que ele foi induzido, e prejuízos para os demais periódicos periféricos, porém não é suficiente para que eles saiam do quartil periférico de centralidade a que pertenciam antes da manipulação dos efeitos. Além disso, observou-se que, na ausência de elementos que alterem a capacidade intrínseca de atração de ligações de um periódico, a interrupção do Comportamento Estratégico levou aos níveis anteriores de centralidade. Também se observou que o Comportamento Estratégico acarretou em alterações de centralidade medida por autovetor estatisticamente significativas, porém não esperadas, mas que, após sua interrupção, esta retornou aos patamares anteriores à indução dos efeitos.

Phenotypic divergence along lines of genetic variance

Natural populations inhabiting the same environment often independently evolve the same phenotype. Is this replicated evolution a result of genetic constraints imposed by patterns of genetic covariation? We looked for associations between directions of morphological divergence and the orientation of the genetic variance-covariance matrix (G) by using an experimental system of morphological evolution in two allopatric nonsister species of rainbow fish. Replicate populations of both Melanotaenia eachamensis and Melanotaenia duboulayi have independently adapted to lake versus stream hydrodynamic environments. The major axis of divergence (z) among all eight study populations was closely associated with the direction of greatest genetic variance (g(max)), suggesting directional genetic constraint on evolution. However, the direction of hydrodynamic adaptation was strongly associated with vectors of G describing relatively small proportions of the total genetic variance, and was only weakly associated with g(max). In contrast, divergence between replicate populations within each habitat was approximately proportional to the level of genetic variance, a result consistent with theoretical predictions for neutral phenotypic divergence. Divergence between the two species was also primarily along major eigenvectors of G. Our results therefore suggest that hydrodynamic adaptation in rainbow fish was not directionally constrained by the dominant eigenvector of G. Without partitioning divergence as a consequence of the adaptation of interest (here, hydrodynamic adaptation) from divergence due to other processes, empirical studies are likely to overestimate the potential for the major eigenvectors of G to directionally constrain adaptive evolution.

A class of self-stabilizing MCA learning algorithms

In this letter, we propose a class of self-stabilizing learning algorithms for minor component analysis (MCA), which includes a few well-known MCA learning algorithms. Self-stabilizing means that the sign of the weight vector length change is independent of the presented input vector. For these algorithms, rigorous global convergence proof is given and the convergence rate is also discussed. By combining the positive properties of these algorithms, a new learning algorithm is proposed which can improve the performance. Simulations are employed to confirm our theoretical results.

Properties of sparse random matrices over finite fields

Typical properties of sparse random matrices over finite (Galois) fields are studied, in the limit of large matrices, using techniques from the physics of disordered systems. For the case of a finite field GF(q) with prime order q, we present results for the average kernel dimension, average dimension of the eigenvector spaces and the distribution of the eigenvalues. The number of matrices for a given distribution of entries is also calculated for the general case. The significance of these results to error-correcting codes and random graphs is also discussed.

Feature Extraction for Classification in the Data Mining Process

Dimensionality reduction is a very important step in the data mining process. In this paper, we consider feature extraction for classification tasks as a technique to overcome problems occurring because of “the curse of dimensionality”. Three different eigenvector-based feature extraction approaches are discussed and three different kinds of applications with respect to classification tasks are considered. The summary of obtained results concerning the accuracy of classification schemes is presented with the conclusion about the search for the most appropriate feature extraction method. The problem how to discover knowledge needed to integrate the feature extraction and classification processes is stated. A decision support system to aid in the integration of the feature extraction and classification processes is proposed. The goals and requirements set for the decision support system and its basic structure are defined. The means of knowledge acquisition needed to build up the proposed system are considered.

A method for solving LSM problems of small size in the AHP

The Analytic Hierarchy Process (AHP) is one of the most popular methods used in Multi-Attribute Decision Making. It provides with ratio-scale measurements of the prioirities of elements on the various leveles of a hierarchy. These priorities are obtained through the pairwise comparisons of elements on one level with reference to each element on the immediate higher level. The Eigenvector Method (EM) and some distance minimizing methods such as the Least Squares Method (LSM), Logarithmic Least Squares Method (LLSM), Weighted Least Squares Method (WLSM) and Chi Squares Method (X2M) are of the tools for computing the priorities of the alternatives. This paper studies a method for generating all the solutions of the LSM problems for 3 × 3 matrices. We observe non-uniqueness and rank reversals by presenting numerical results.

Solving the Least Squares Method problem in the AHP for 3 X 3 and 4 X 4 matrices

The Analytic Hierarchy Process (AHP) is one of the most popular methods used in Multi-Attribute Decision Making. The Eigenvector Method (EM) and some distance minimizing methods such as the Least Squares Method (LSM) are of the possible tools for computing the priorities of the alternatives. A method for generating all the solutions of the LSM problem for 3 × 3 and 4 × 4 matrices is discussed in the paper. Our algorithms are based on the theory of resultants.

Incomplete pairwise comparison matrices and weighting methods

A special class of preferences, given by a directed acyclic graph, is considered. They are represented by incomplete pairwise comparison matrices as only partial information is available: for some pairs no comparison is given in the graph. A weighting method satisfies the property linear order preservation if it always results in a ranking such that an alternative directly preferred to another does not have a lower rank. We study whether two procedures, the Eigenvector Method and the Logarithmic Least Squares Method meet this axiom. Both weighting methods break linear order preservation, moreover, the ranking according to the Eigenvector Method depends on the incomplete pairwise comparison representation chosen.

Applying the Analytic Hierarchy Process in healthcare research: A systematic literature review and evaluation of reporting

Background: The Analytic Hierarchy Process (AHP), developed by Saaty in the late 1970s, is one of the methods for multi-criteria decision making. The AHP disaggregates a complex decision problem into different hierarchical levels. The weight for each criterion and alternative are judged in pairwise comparisons and priorities are calculated by the Eigenvector method. The slowly increasing application of the AHP was the motivation for this study to explore the current state of its methodology in the healthcare context. Methods: A systematic literature review was conducted by searching the Pubmed and Web of Science databases for articles with the following keywords in their titles or abstracts: "Analytic Hierarchy Process," "Analytical Hierarchy Process," "multi-criteria decision analysis," "multiple criteria decision," "stated preference," and "pairwise comparison." In addition, we developed reporting criteria to indicate whether the authors reported important aspects and evaluated the resulting studies' reporting. Results: The systematic review resulted in 121 articles. The number of studies applying AHP has increased since 2005. Most studies were from Asia (almost 30 %), followed by the US (25.6 %). On average, the studies used 19.64 criteria throughout their hierarchical levels. Furthermore, we restricted a detailed analysis to those articles published within the last 5 years (n = 69). The mean of participants in these studies were 109, whereas we identified major differences in how the surveys were conducted. The evaluation of reporting showed that the mean of reported elements was about 6.75 out of 10. Thus, 12 out of 69 studies reported less than half of the criteria. Conclusion: The AHP has been applied inconsistently in healthcare research. A minority of studies described all the relevant aspects. Thus, the statements in this review may be biased, as they are restricted to the information available in the papers. Hence, further research is required to discover who should be interviewed and how, how inconsistent answers should be dealt with, and how the outcome and stability of the results should be presented. In addition, we need new insights to determine which target group can best handle the challenges of the AHP. © 2015 Schmidt et al.

Spectral-based mesh segmentation

In design and manufacturing, mesh segmentation is required for FACE construction in boundary representation (BRep), which in turn is central for featurebased design, machining, parametric CAD and reverse engineering, among others -- Although mesh segmentation is dictated by geometry and topology, this article focuses on the topological aspect (graph spectrum), as we consider that this tool has not been fully exploited -- We preprocess the mesh to obtain a edgelength homogeneous triangle set and its Graph Laplacian is calculated -- We then produce a monotonically increasing permutation of the Fiedler vector (2nd eigenvector of Graph Laplacian) for encoding the connectivity among part feature submeshes -- Within the mutated vector, discontinuities larger than a threshold (interactively set by a human) determine the partition of the original mesh -- We present tests of our method on large complex meshes, which show results which mostly adjust to BRep FACE partition -- The achieved segmentations properly locate most manufacturing features, although it requires human interaction to avoid over segmentation -- Future work includes an iterative application of this algorithm to progressively sever features of the mesh left from previous submesh removals

Topological massive Dirac edge modes and long-range superconducting Hamiltonians

We discover novel topological effects in the one-dimensional Kitaev chain modified by long-range Hamiltonian deformations in the hopping and pairing terms. This class of models display symmetry-protected topological order measured by the Berry/Zak phase of the lower-band eigenvector and the winding number of the Hamiltonians. For exponentially decaying hopping amplitudes, the topological sector can be significantly augmented as the penetration length increases, something experimentally achievable. For power-law decaying superconducting pairings, the massless Majorana modes at the edges get paired together into a massive nonlocal Dirac fermion localized at both edges of the chain: a new topological quasiparticle that we call topological massive Dirac fermion. This topological phase has fractional topological numbers as a consequence of the long-range couplings. Possible applications to current experimental setups and topological quantum computation are also discussed.

Cost sharing solutions defined by non-negative eigenvectors

The problem of sharing a cost M among n individuals, identified by some characteristic ci∈R+,ci∈R+, appears in many real situations. Two important proposals on how to share the cost are the egalitarian and the proportional solutions. In different situations a combination of both distributions provides an interesting approach to the cost sharing problem. In this paper we obtain a family of (compromise) solutions associated to the Perron’s eigenvectors of Levinger’s transformations of a characteristics matrix A. This family includes both the egalitarian and proportional solutions, as well as a set of suitable intermediate proposals, which we analyze in some specific contexts, as claims problems and inventory cost games.

Geographical gradients in Argentinean terrestrial mammal species richness and their environmental correlates.

We analysed the main geographical trends of terrestrial mammal species richness (SR) in Argentina, assessing how broad-scale environmental variation (defined by climatic and topographic variables) and the spatial form of the country (defined by spatial filters based on spatial eigenvector mapping (SEVM)) influence the kinds and the numbers of mammal species along these geographical trends. We also evaluated if there are pure geographical trends not accounted for by the environmental or spatial factors. The environmental variables and spatial filters that simultaneously correlated with the geographical variables and SR were considered potential causes of the geographic trends. We performed partial correlations between SR and the geographical variables, maintaining the selected explanatory variables statistically constant, to determine if SR was fully explained by them or if a significant residual geographic pattern remained. All groups and subgroups presented a latitudinal gradient not attributable to the spatial form of the country. Most of these trends were not explained by climate.We used a variation partitioning procedure to quantify the pure geographic trend (PGT) that remained unaccounted for. The PGT was larger for latitudinal than for longitudinal gradients. This suggests that historical or purely geographical causes may also be relevant drivers of these geographical gradients in mammal diversity.