Computación evolutiva de bosques de expansión mínimos con restricción de grado y de rol

Encontrar el árbol de expansión mínimo con restricción de grado de un grafo (DCMST por sus siglas en inglés) es un problema NP-complejo ampliamente estudiado. Una de sus aplicaciones más importantes es el dise~no de redes. Aquí nosotros tratamos una nueva variante del problema DCMST, que consiste en encontrar el árbol de expansión mínimo no solo con restricciones de grado, sino también con restricciones de rol (DRCMST), es decir, a~nadimos restricciones para restringir el rol que los nodos tienen en el árbol. Estos roles pueden ser nodo raíz, nodo intermedio o nodo hoja. Por otra parte, no limitamos el número de nodos raíz a uno, por lo que, en general, construiremos bosques de DRCMSTs. El modelado en los problemas de dise~no de redes puede beneficiarse de la posibilidad de generar más de un árbol y determinar el rol de los nodos en la red. Proponemos una nueva representación basada en permutaciones para codificar los bosques de DRCMSTs. En esta nueva representación, una permutación codifica simultáneamente todos los árboles que se construirán. Nosotros simulamos una amplia variedad de problemas DRCMST que optimizamos utilizando ocho algoritmos de computación evolutiva diferentes que codifican los individuos de la población utilizando la representación propuesta. Los algoritmos que utilizamos son: algoritmo de estimación de distribuciones (EDA), algoritmo genético generacional (gGA), algoritmo genético de estado estacionario (ssGA), estrategia evolutiva basada en la matriz de covarianzas (CMAES), evolución diferencial (DE), estrategia evolutiva elitista (ElitistES), estrategia evolutiva no elitista (NonElitistES) y optimización por enjambre de partículas (PSO). Los mejores resultados fueron para el algoritmo de estimación de distribuciones utilizado y ambos tipos de algoritmos genéticos, aunque los algoritmos genéticos fueron significativamente más rápidos.---ABSTRACT---Finding the degree-constrained minimum spanning tree (DCMST) of a graph is a widely studied NP-hard problem. One of its most important applications is network design. Here we deal with a new variant of the DCMST problem, which consists of finding not only the degree- but also the role-constrained minimum spanning tree (DRCMST), i.e., we add constraints to restrict the role of the nodes in the tree to root, intermediate or leaf node. Furthermore, we do not limit the number of root nodes to one, thereby, generally, building a forest of DRCMSTs. The modeling of network design problems can benefit from the possibility of generating more than one tree and determining the role of the nodes in the network. We propose a novel permutation-based representation to encode the forest of DRCMSTs. In this new representation, one permutation simultaneously encodes all the trees to be built. We simulate a wide variety of DRCMST problems which we optimize using eight diferent evolutionary computation algorithms encoding individuals of the population using the proposed representation. The algorithms we use are: estimation of distribution algorithm (EDA), generational genetic algorithm (gGA), steady-state genetic algorithm (ssGA), covariance matrix adaptation evolution strategy (CMAES), diferential evolution (DE), elitist evolution strategy (ElististES), non-elitist evolution strategy (NonElististES) and particle swarm optimization (PSO). The best results are for the estimation of distribution algorithm and both types of genetic algorithms, although the genetic algorithms are significantly faster. iv

Genetic diversity and population structure of Tasmanian devils, the largest marsupial carnivore

Genetic diversity and population structure were investigated across the core range of Tasmanian devils (Sarcophilus laniarius; Dasyuridae), a wide-ranging marsupial carnivore restricted to the island of Tasmania. Heterozygosity (0.386-0.467) and allelic diversity (2.7-3.3) were low in all subpopulations and allelic size ranges were small and almost continuous, consistent with a founder effect. Island effects and repeated periods of low population density may also have contributed to the low variation. Within continuous habitat, gene flow appears extensive up to 50 km (high assignment rates to source or close neighbour populations; nonsignificant values of pairwise F-ST), in agreement with movement data. At larger scales (150-250 km), gene flow is reduced (significant pairwise F-ST) but there is no evidence for isolation by distance. The most substantial genetic structuring was observed for comparisons spanning unsuitable habitat, implying limited dispersal of devils between the well-connected, eastern populations and a smaller northwestern population. The genetic distinctiveness of the northwestern population was reflected in all analyses: unique alleles; multivariate analyses of gene frequency (multidimensional scaling, minimum spanning tree, nearest neighbour); high self-assignment (95%); two distinct populations for Tasmania were detected in isolation by distance and in Bayesian model-based clustering analyses. Marsupial carnivores appear to have stronger population subdivisions than their placental counterparts.

Developing multidimensional metrics for evaluating paediatric neurodevelopmental disorders

Healthy brain functioning depends on efficient communication of information between brain regions, forming complex networks. By quantifying synchronisation between brain regions, a functionally connected brain network can be articulated. In neurodevelopmental disorders, where diagnosis is based on measures of behaviour and tasks, a measure of the underlying biological mechanisms holds promise as a potential clinical tool. Graph theory provides a tool for investigating the neural correlates of neuropsychiatric disorders, where there is disruption of efficient communication within and between brain networks. This research aimed to use recent conceptualisation of graph theory, along with measures of behaviour and cognitive functioning, to increase understanding of the neurobiological risk factors of atypical development. Using magnetoencephalography to investigate frequency-specific temporal dynamics at rest, the research aimed to identify potential biological markers derived from sensor-level whole-brain functional connectivity. Whilst graph theory has proved valuable for insight into network efficiency, its application is hampered by two limitations. First, its measures have hardly been validated in MEG studies, and second, graph measures have been shown to depend on methodological assumptions that restrict direct network comparisons. The first experimental study (Chapter 3) addressed the first limitation by examining the reproducibility of graph-based functional connectivity and network parameters in healthy adult volunteers. Subsequent chapters addressed the second limitation through adapted minimum spanning tree (a network analysis approach that allows for unbiased group comparisons) along with graph network tools that had been shown in Chapter 3 to be highly reproducible. Network topologies were modelled in healthy development (Chapter 4), and atypical neurodevelopment (Chapters 5 and 6). The results provided support to the proposition that measures of network organisation, derived from sensor-space MEG data, offer insights helping to unravel the biological basis of typical brain maturation and neurodevelopmental conditions, with the possibility of future clinical utility.

Algoritmos experimentais para o problema biobjetivo da árvore geradora quadrática em adjacência de arestas

The Quadratic Minimum Spanning Tree (QMST) problem is a generalization of the Minimum Spanning Tree problem in which, beyond linear costs associated to each edge, quadratic costs associated to each pair of edges must be considered. The quadratic costs are due to interaction costs between the edges. When interactions occur between adjacent edges only, the problem is named Adjacent Only Quadratic Minimum Spanning Tree (AQMST). Both QMST and AQMST are NP-hard and model a number of real world applications involving infrastructure networks design. Linear and quadratic costs are summed in the mono-objective versions of the problems. However, real world applications often deal with conflicting objectives. In those cases, considering linear and quadratic costs separately is more appropriate and multi-objective optimization provides a more realistic modelling. Exact and heuristic algorithms are investigated in this work for the Bi-objective Adjacent Only Quadratic Spanning Tree Problem. The following techniques are proposed: backtracking, branch-and-bound, Pareto Local Search, Greedy Randomized Adaptive Search Procedure, Simulated Annealing, NSGA-II, Transgenetic Algorithm, Particle Swarm Optimization and a hybridization of the Transgenetic Algorithm with the MOEA-D technique. Pareto compliant quality indicators are used to compare the algorithms on a set of benchmark instances proposed in literature.

Algoritmos experimentais para o problema biobjetivo da árvore geradora quadrática em adjacência de arestas

The Quadratic Minimum Spanning Tree (QMST) problem is a generalization of the Minimum Spanning Tree problem in which, beyond linear costs associated to each edge, quadratic costs associated to each pair of edges must be considered. The quadratic costs are due to interaction costs between the edges. When interactions occur between adjacent edges only, the problem is named Adjacent Only Quadratic Minimum Spanning Tree (AQMST). Both QMST and AQMST are NP-hard and model a number of real world applications involving infrastructure networks design. Linear and quadratic costs are summed in the mono-objective versions of the problems. However, real world applications often deal with conflicting objectives. In those cases, considering linear and quadratic costs separately is more appropriate and multi-objective optimization provides a more realistic modelling. Exact and heuristic algorithms are investigated in this work for the Bi-objective Adjacent Only Quadratic Spanning Tree Problem. The following techniques are proposed: backtracking, branch-and-bound, Pareto Local Search, Greedy Randomized Adaptive Search Procedure, Simulated Annealing, NSGA-II, Transgenetic Algorithm, Particle Swarm Optimization and a hybridization of the Transgenetic Algorithm with the MOEA-D technique. Pareto compliant quality indicators are used to compare the algorithms on a set of benchmark instances proposed in literature.

Agroclimatic classification: numerical- taxonomic procedures - a review.

The paper catalogues the procedures and steps involved in agroclimatic classification. These vary from conventional descriptive methods to modern computer-based numerical techniques. There are three mutually independent numerical classification techniques, namely Ordination, Cluster analysis, and Minimum spanning tree; and under each technique there are several forms of grouping techniques existing. The vhoice of numerical classification procedure differs with the type of data set. In the case of numerical continuous data sets with booth positive and negative values, the simple and least controversial procedures are unweighted pair group method (UPGMA) and weighted pair group method (WPGMA) under clustering techniques with similarity measure obtained either from Gower metric or standardized Euclidean metric. Where the number of attributes are large, these could be reduced to fewer new attributes defined by the principal components or coordinates by ordination technique. The first few components or coodinates explain the maximum variance in the data matrix. These revided attributes are less affected by noise in the data set. It is possible to check misclassifications using minimum spanning tree.

The specific shapes of gender imbalance in scientific authorships : a network approach

Gender differences in collaborative research have received little at- tention when compared with the growing importance that women hold in academia and research. Unsurprisingly, most of bibliomet- ric databases have a strong lack of directly available information by gender. Although empirical-based network approaches are often used in the study of research collaboration, the studies about the influence of gender dissimilarities on the resulting topological outcomes are still scarce. Here, networks of scientific subjects are used to characterize patterns that might be associated to five categories of authorships which were built based on gender. We find enough evidence that gen- der imbalance in scientific authorships brings a peculiar trait to the networks induced from papers published in Web of Science (WoS) in- dexed journals of Economics over the period 2010-2015 and having at least one author affiliated to a Portuguese institution. Our re- sults show the emergence of a specific pattern when the network of co-occurring subjects is induced from a set of papers exclusively au- thored by men. Such a male-exclusive authorship condition is found to be the solely responsible for the emergence that particular shape in the network structure. This peculiar trait might facilitate future network analyses of research collaboration and interdisciplinarity.

A visual-numeric approach to clustering and anomaly detection for trajectory data

This paper proposes a novel application of Visual Assessment of Tendency (VAT)-based hierarchical clustering algorithms (VAT, iVAT, and clusiVAT) for trajectory analysis. We introduce a new clustering based anomaly detection framework named iVAT+ and clusiVAT+ and use it for trajectory anomaly detection. This approach is based on partitioning the VAT-generated Minimum Spanning Tree based on an efficient thresholding scheme. The trajectories are classified as normal or anomalous based on the number of paths in the clusters. On synthetic datasets with fixed and variable numbers of clusters and anomalies, we achieve 98 % classification accuracy. Our two-stage clusiVAT method is applied to 26,039 trajectories of vehicles and pedestrians from a parking lot scene from the real life MIT trajectories dataset. The first stage clusters the trajectories ignoring directionality. The second stage divides the clusters obtained from the first stage by considering trajectory direction. We show that our novel two-stage clusiVAT approach can produce natural and informative trajectory clusters on this real life dataset while finding representative anomalies.

Quantum kernels for unattributed graphs using discrete-time quantum walks

In this paper, we develop a new family of graph kernels where the graph structure is probed by means of a discrete-time quantum walk. Given a pair of graphs, we let a quantum walk evolve on each graph and compute a density matrix with each walk. With the density matrices for the pair of graphs to hand, the kernel between the graphs is defined as the negative exponential of the quantum Jensen–Shannon divergence between their density matrices. In order to cope with large graph structures, we propose to construct a sparser version of the original graphs using the simplification method introduced in Qiu and Hancock (2007). To this end, we compute the minimum spanning tree over the commute time matrix of a graph. This spanning tree representation minimizes the number of edges of the original graph while preserving most of its structural information. The kernel between two graphs is then computed on their respective minimum spanning trees. We evaluate the performance of the proposed kernels on several standard graph datasets and we demonstrate their effectiveness and efficiency.

Splitting of a prevalent Mycobacterium bovis spoligotype by variable-number tandem-repeat typing reveals high heterogeneity in an evolving clonal group

Mycobacterium bovis populations in countries with persistent bovine tuberculosis usually show a prevalent spoligotype with a wide geographical distribution. This study applied mycobacterial interspersed repetitive-unit-variable-number tandem-repeat (MIRU-VNTR) typing to a random panel of 115 M. bovis isolates that are representative of the most frequent spoligotype in the Iberian Peninsula, SB0121. VNTR typing targeted nine loci: ETR-A (alias VNTR2165), ETR-B (VNTR2461), ETR-D (MIRU4, VNTR580), ETR-E (MIRU31, VNTR3192), MIRU26 (VNTR2996), QUB11a (VNTR2163a), QUB11b (VNTR2163b), QUB26 (VNTR4052), and QUB3232 (VNTR3232). We found a high degree of diversity among the studied isolates (discriminatory index [D] = 0.9856), which were split into 65 different MIRU-VNTR types. An alternative short-format MIRU-VNTR typing targeting only the four loci with the highest variability values was found to offer an equivalent discriminatory index. Minimum spanning trees using the MIRU-VNTR data showed the hypothetical evolution of an apparent clonal group. MIRU-VNTR analysis was also applied to the isolates of 176 animals from 15 farms infected by M. bovis SB0121; in 10 farms, the analysis revealed the coexistence of two to five different MIRU types differing in one to six loci, which highlights the frequency of undetected heterogeneity.

Product Dimension of Forests and Bounded Treewidth Graphs

The product dimension of a graph G is defined as the minimum natural number l such that G is an induced subgraph of a direct product of l complete graphs. In this paper we study the product dimension of forests, bounded treewidth graphs and k-degenerate graphs. We show that every forest on n vertices has product dimension at most 1.441 log n + 3. This improves the best known upper bound of 3 log n for the same due to Poljak and Pultr. The technique used in arriving at the above bound is extended and combined with a well-known result on the existence of orthogonal Latin squares to show that every graph on n vertices with treewidth at most t has product dimension at most (t + 2) (log n + 1). We also show that every k-degenerate graph on n vertices has product dimension at most inverted right perpendicular5.545 k log ninverted left perpendicular + 1. This improves the upper bound of 32 k log n for the same by Eaton and Rodl.

Deer forests, game shooting and landed estates in the South West of Ireland, 1840 - 1970

This thesis is concentrated on the historical aspects of the elitist field sports of deer stalking and game shooting, as practiced by four Irish landed ascendancy families in the south west of Ireland. Four great estates were selected for study. Two of these were, by Irish standards, very large: the Kenmare estate of over 136,000 acres in the ownership of the Roman Catholic Earls of Kenmare, and the Herbert estate of over 44,000 acres in the ownership of the Protestant Herbert family. The other two were, in relative terms, small: the Grehan estate of c.7,500 acres in the ownership of the Roman Catholic Grehan family, and the Godfrey estate of c.5,000 acres, in the ownership of the Protestant Barons Godfrey. This mixture of contrasting estate size, owner's religions, nobleman, minor aristocrat and untitled gentry should, it is argued, yield a diversity of the field sports and lifestyles of their owners, and go some way to assess the contributions, good or bad, they have bequeathed to modern Ireland. Equally, it should help in assessing what importance, if any, applied to hunting. In this context, hunting is here used in its broadest meaning, and includes deer stalking and game shooting, as well as hunting with dogs and hounds on foot and horseback. Where a specific type of hunting is involved, it is so described; for example, fox hunting, stag hunting, hare hunting. Similarly, the term game is sometimes used in sporting literature to encompass all species of quarry killed, and can include deer, ground game (hares and rabbits), waterfowl, and various species of game birds. Where it refers to specific species, these are so described; for example grouse, pheasants, woodcork, wild duck, etc. Since two of these estates - the Kenmare and Herbert - each created a deer forest, unique in mid-19th century Ireland, they form the core study estates; the two smaller estates serve as comparative studies. And, equally unique, as these two larger estates held the only remnant population of native Irish red deer, the survival of that herd itself forms a concomitant core area of analysis. The numerary descriptions applied to these animals in popular literature are critically reassessed against prime source historical evidence, as are the so-called deer forest 'clearances'. The core period, 1840 to 1970, is selected as the seminal period, spanning 130 years, from the creation of the deer forests to when a fundamental change in policy and administration was introduced by the state. Comparison is made with similar estates elsewhere, in Britain and especially in Scotland. Their influence on the Irish methods and style of hunting is historically examined.

Threats and knowledge gaps for ecosystem services provided by kelp forests: a northeast Atlantic perspective.

Kelp forests along temperate and polar coastlines represent some of most diverse and productive habitats on the Earth. Here, we synthesize information from >60 years of research on the structure and functioning of kelp forest habitats in European waters, with particular emphasis on the coasts of UK and Ireland, which represents an important biogeographic transition zone that is subjected to multiple threats and stressors. We collated existing data on kelp distribution and abundance and reanalyzed these data to describe the structure of kelp forests along a spatial gradient spanning more than 10° of latitude. We then examined ecological goods and services provided by kelp forests, including elevated secondary production, nutrient cycling, energy capture and flow, coastal defense, direct applications, and biodiversity repositories, before discussing current and future threats posed to kelp forests and identifying key knowledge gaps. Recent evidence unequivocally demonstrates that the structure of kelp forests in the NE Atlantic is changing in response to climate- and non-climate-related stressors, which will have major implications for the structure and functioning of coastal ecosystems. However, kelp-dominated habitats along much of the NE Atlantic coastline have been chronically understudied over recent decades in comparison with other regions such as Australasia and North America. The paucity of field-based research currently impedes our ability to conserve and manage these important ecosystems. Targeted observational and experimental research conducted over large spatial and temporal scales is urgently needed to address these knowledge gaps.

Fine-root turnover rates of European forests revisited: an analysis of data from sequential coring and ingrowth cores

Background and Aims Forest trees directly contribute to carbon cycling in forest soils through the turnover of their fine roots. In this study we aimed to calculate root turnover rates of common European forest tree species and to compare them with most frequently published values. Methods We compiled available European data and applied various turnover rate calculation methods to the resulting database. We used Decision Matrix and Maximum-Minimum formula as suggested in the literature. Results Mean turnover rates obtained by the combination of sequential coring and Decision Matrix were 0.86 yr−1 for Fagus sylvatica and 0.88 yr−1 for Picea abies when maximum biomass data were used for the calculation, and 1.11 yr−1 for both species when mean biomass data were used. Using mean biomass rather than maximum resulted in about 30 % higher values of root turnover. Using the Decision Matrix to calculate turnover rate doubled the rates when compared to the Maximum-Minimum formula. The Decision Matrix, however, makes use of more input information than the Maximum-Minimum formula. Conclusions We propose that calculations using the Decision Matrix with mean biomass give the most reliable estimates of root turnover rates in European forests and should preferentially be used in models and C reporting.