An Improved Multi-Sensor Fusion Navigation Algorithm Based on the Factor Graph.

PubMed

Zeng, Qinghua; Chen, Weina; Liu, Jianye; Wang, Huizhe

2017-03-21

An integrated navigation system coupled with additional sensors can be used in the Micro Unmanned Aerial Vehicle (MUAV) applications because the multi-sensor information is redundant and complementary, which can markedly improve the system accuracy. How to deal with the information gathered from different sensors efficiently is an important problem. The fact that different sensors provide measurements asynchronously may complicate the processing of these measurements. In addition, the output signals of some sensors appear to have a non-linear character. In order to incorporate these measurements and calculate a navigation solution in real time, the multi-sensor fusion algorithm based on factor graph is proposed. The global optimum solution is factorized according to the chain structure of the factor graph, which allows for a more general form of the conditional probability density. It can convert the fusion matter into connecting factors defined by these measurements to the graph without considering the relationship between the sensor update frequency and the fusion period. An experimental MUAV system has been built and some experiments have been performed to prove the effectiveness of the proposed method.

Percolation in insect nest networks: Evidence for optimal wiring

NASA Astrophysics Data System (ADS)

Valverde, Sergi; Corominas-Murtra, Bernat; Perna, Andrea; Kuntz, Pascale; Theraulaz, Guy; Solé, Ricard V.

2009-06-01

Optimization has been shown to be a driving force for the evolution of some biological structures, such as neural maps in the brain or transport networks. Here we show that insect networks also display characteristic traits of optimality. By using a graph representation of the chamber organization of termite nests and a disordered lattice model, it is found that these spatial nests are close to a percolation threshold. This suggests that termites build efficient systems of galleries spanning most of the nest volume at low cost. The evolutionary consequences are outlined.

Internally connected graphs and the Kashiwara-Vergne Lie algebra

NASA Astrophysics Data System (ADS)

Felder, Matteo

2018-06-01

It is conjectured that the Kashiwara-Vergne Lie algebra \\widehat{krv}_2 is isomorphic to the direct sum of the Grothendieck-Teichmüller Lie algebra grt_1 and a one-dimensional Lie algebra. In this paper, we use the graph complex of internally connected graphs to define a nested sequence of Lie subalgebras of \\widehat{krv}_2 whose intersection is grt_1, thus giving a way to interpolate between these two Lie algebras.

Factors influencing nesting success of burrowing owls in southeastern Idaho

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gleason, R.S.; Johnson, D.R.

1985-01-31

A burrowing owl (Athene cunicularia) population nesting on the Idaho National Engineering Laboratory (INEL) in southeastern Idaho utilized burrows excavated by badgers (Taxidea taxus) or natural cavities in lava flows as nesting sites. The size of the population was small (N = 13-14 pairs) in relation to the number of available nesting sites, suggesting that factors other than burrow availability limited this population. Rodents and Jerusalem crickets (Stenopelmatus fuscus) represented the primary prey utilized during the nesting season. This population demonstrated both a numerical (brood size) and functional (dietary) response to a decrease in the density of three species ofmore » rodents on the INEL during a drought in 1977. 11 references, 1 figure, 2 table.« less

Ticks as a factor in nest desertion of California brown pelicans

USGS Publications Warehouse

King, Kirke A.; Keith, James O.; Mitchell, Christine A.; Keirans, James E.

1977-01-01

In summary, our observations suggest that O. denmarki may be an important environmental factor influencing the distribution and success of Brown Pelican nests in the Gulf of California. More information on these relationships may be unobtainable without seriously disturbing and destroying large numbers of nests.

An Improved Multi-Sensor Fusion Navigation Algorithm Based on the Factor Graph

PubMed Central

Zeng, Qinghua; Chen, Weina; Liu, Jianye; Wang, Huizhe

2017-01-01

An integrated navigation system coupled with additional sensors can be used in the Micro Unmanned Aerial Vehicle (MUAV) applications because the multi-sensor information is redundant and complementary, which can markedly improve the system accuracy. How to deal with the information gathered from different sensors efficiently is an important problem. The fact that different sensors provide measurements asynchronously may complicate the processing of these measurements. In addition, the output signals of some sensors appear to have a non-linear character. In order to incorporate these measurements and calculate a navigation solution in real time, the multi-sensor fusion algorithm based on factor graph is proposed. The global optimum solution is factorized according to the chain structure of the factor graph, which allows for a more general form of the conditional probability density. It can convert the fusion matter into connecting factors defined by these measurements to the graph without considering the relationship between the sensor update frequency and the fusion period. An experimental MUAV system has been built and some experiments have been performed to prove the effectiveness of the proposed method. PMID:28335570

Factors influencing occupancy of nest cavities in recently burned forests

USGS Publications Warehouse

Saab, V.A.; Dudley, J.; Thompson, W.L.

2004-01-01

Recently burned forests in western North America provide nesting habitat for many species of cavity-nesting birds. However, little is understood about the time frame and the variables affecting occupancy of postfire habitats by these birds. We studied factors influencing the occupancy and reuse of nest cavities from 1-7 years after fire in two burned sites of western Idaho during 1994-1999. Tree cavities were used for nesting by 12 species of cavity nesters that were classified by the original occupant (strong excavator, weak excavator, or nonexcavator) of 385 nest cavities. We used logistic regression to model cavity occupancy by strong excavators (n = 575 trials) and weak excavators (n = 206 trials). Year after fire had the greatest influence on occupancy of nest cavities for both groups, while site of the burn was secondarily important in predicting occupancy by strong excavators and less important for weak excavators. Predicted probability of cavity occupancy was highest during the early years (1-4) after fire, declined over time (5-7 years after fire), and varied by site, with a faster decline in the smaller burned site with a greater mosaic of unburned forest. Closer proximity and greater interspersion of unburned forest (15% unburned) may have allowed a quicker recolonization by nest predators into the smaller burn compared to the larger burn with few patches of unburned forest (4% unburned). In combination with time and space effects, the predicted probability of cavity occupancy was positively affected by tree and nest heights for strong and weak excavators, respectively.

Object recognition in images via a factor graph model

NASA Astrophysics Data System (ADS)

He, Yong; Wang, Long; Wu, Zhaolin; Zhang, Haisu

2018-04-01

Object recognition in images suffered from huge search space and uncertain object profile. Recently, the Bag-of- Words methods are utilized to solve these problems, especially the 2-dimension CRF(Conditional Random Field) model. In this paper we suggest the method based on a general and flexible fact graph model, which can catch the long-range correlation in Bag-of-Words by constructing a network learning framework contrasted from lattice in CRF. Furthermore, we explore a parameter learning algorithm based on the gradient descent and Loopy Sum-Product algorithms for the factor graph model. Experimental results on Graz 02 dataset show that, the recognition performance of our method in precision and recall is better than a state-of-art method and the original CRF model, demonstrating the effectiveness of the proposed method.

Visualizing Dataflow Graphs of Deep Learning Models in TensorFlow.

PubMed

Wongsuphasawat, Kanit; Smilkov, Daniel; Wexler, James; Wilson, Jimbo; Mane, Dandelion; Fritz, Doug; Krishnan, Dilip; Viegas, Fernanda B; Wattenberg, Martin

2018-01-01

We present a design study of the TensorFlow Graph Visualizer, part of the TensorFlow machine intelligence platform. This tool helps users understand complex machine learning architectures by visualizing their underlying dataflow graphs. The tool works by applying a series of graph transformations that enable standard layout techniques to produce a legible interactive diagram. To declutter the graph, we decouple non-critical nodes from the layout. To provide an overview, we build a clustered graph using the hierarchical structure annotated in the source code. To support exploration of nested structure on demand, we perform edge bundling to enable stable and responsive cluster expansion. Finally, we detect and highlight repeated structures to emphasize a model's modular composition. To demonstrate the utility of the visualizer, we describe example usage scenarios and report user feedback. Overall, users find the visualizer useful for understanding, debugging, and sharing the structures of their models.

Effects of biotic and abiotic factors on the oxygen content of green sea turtle nests during embryogenesis.

PubMed

Chen, Chiu-Lin; Wang, Chun-Chun; Cheng, I-Jiunn

2010-10-01

Several biotic and abiotic factors can influence nest oxygen content during embryogenesis. Several of these factors were determined during each developmental stage of green sea turtle embryos on Wan-an Island, Penghu Archipelago, Taiwan. We examined oxygen content in 7 nests in 2007 and 11 in 2008. Oxygen in the adjacent sand, total and viable clutch sizes, air, sand and nest temperatures, and sand characters of each nest were also determined. Oxygen content was lower in late stages than in the early and middle stages. It was also lower in the middle layer than in the upper and bottom layers. Nest temperature showed opposite trends, reaching its maximum value in late stages of development. Nest oxygen content was influenced by fraction of viable eggs, total clutch sizes, sand temperatures, maximum nest temperature and maximum change in the nest temperature during incubation. Clutch size during embryogenesis was the most influential factor overall. However, the major influential factors were different for different developmental stages. In the first half of the incubation, the development rate was low, and the change in the nest oxygen content was influenced mainly by the clutch size. During the second half, the rapid embryonic development rate became the dominant factor, and hatchling activities caused even greater oxygen consumption during the last stage of development.

Factors influencing nesting success of king eiders on northern Alaska's Coastal Plain

USGS Publications Warehouse

Bentzen, R.L.; Powell, A.N.; Suydam, R.S.

2008-01-01

King eider (Somateria spectabilis) populations have declined markedly in recent decades for unknown reasons. Nest survival is one component of recruitment, and a female's chance of reproductive success increases with her ability to choose an appropriate nesting strategy. We estimated variation in daily nest survival of king eiders at 2 sites, Teshekpuk and Kuparuk, Alaska, USA, 2002-2005. We evaluated both a priori and exploratory competing models of nest survival that considered importance of nest concealment, seclusion, and incubation constancy as strategies to avoid 2 primary egg predators, avian (Larus spp., Stercorarius spp., and Corvus corax) and fox (Alopex lagopus). We used generalized nonlinear techniques to examine factors affecting nest survival rates and information-theoretic approaches to select among competing models. Estimated nest survival, accounting for a nest visitation effect, varied considerably across sites and years (0.21-0.57); however, given our small sample size, much of this variation maybe attributable to sampling variation (??process = 0.007, 95% CI: 0.003-0.070). Nest survival was higher at Kuparuk than Teshekpuk in all years; however, due to the correlative nature of our data, we cannot determine the underlying causes with any certainty. We found mixed support for the concealed breeding strategy, females derived no benefit from nesting in areas with more willow (Salix spp.; measure of concealment) except that the observer effect diminished as willow cover increased. We suggest these patterns are due to conflicting predation pressures. Nest survival was not higher on islands (measure of seclusion) or with increased incubation constancy but was higher post-fox removal, indicating that predator control on breeding grounds could be a viable management option. Nest survival was negatively affected by our nest visitations, most likely by exposing the nest to avian scavengers. We recommend precautions be taken to limit the effects of nest

Influence of olfactory and visual cover on nest site selection and nest success for grassland-nesting birds.

PubMed

Fogarty, Dillon T; Elmore, R Dwayne; Fuhlendorf, Samuel D; Loss, Scott R

2017-08-01

Habitat selection by animals is influenced by and mitigates the effects of predation and environmental extremes. For birds, nest site selection is crucial to offspring production because nests are exposed to extreme weather and predation pressure. Predators that forage using olfaction often dominate nest predator communities; therefore, factors that influence olfactory detection (e.g., airflow and weather variables, including turbulence and moisture) should influence nest site selection and survival. However, few studies have assessed the importance of olfactory cover for habitat selection and survival. We assessed whether ground-nesting birds select nest sites based on visual and/or olfactory cover. Additionally, we assessed the importance of visual cover and airflow and weather variables associated with olfactory cover in influencing nest survival. In managed grasslands in Oklahoma, USA, we monitored nests of Northern Bobwhite ( Colinus virginianus ), Eastern Meadowlark ( Sturnella magna ), and Grasshopper Sparrow ( Ammodramus savannarum ) during 2015 and 2016. To assess nest site selection, we compared cover variables between nests and random points. To assess factors influencing nest survival, we used visual cover and olfactory-related measurements (i.e., airflow and weather variables) to model daily nest survival. For nest site selection, nest sites had greater overhead visual cover than random points, but no other significant differences were found. Weather variables hypothesized to influence olfactory detection, specifically precipitation and relative humidity, were the best predictors of and were positively related to daily nest survival. Selection for overhead cover likely contributed to mitigation of thermal extremes and possibly reduced detectability of nests. For daily nest survival, we hypothesize that major nest predators focused on prey other than the monitored species' nests during high moisture conditions, thus increasing nest survival on these

Waterbird nest-site selection is influenced by neighboring nests and island topography

USGS Publications Warehouse

Hartman, Christopher; Ackerman, Joshua T.; Takekawa, John Y.; Herzog, Mark

2016-01-01

Avian nest-site selection is influenced by factors operating across multiple spatial scales. Identifying preferred physical characteristics (e.g., topography, vegetation structure) can inform managers to improve nesting habitat suitability. However, social factors (e.g., attraction, territoriality, competition) can complicate understanding physical characteristics preferred by nesting birds. We simultaneously evaluated the physical characteristics and social factors influencing selection of island nest sites by colonial-nesting American avocets (Recurvirostra americana) and Forster's terns (Sterna forsteri) at 2 spatial scales in San Francisco Bay, 2011–2012. At the larger island plot (1 m2) scale, we used real-time kinematics to produce detailed topographies of nesting islands and map the distribution of nests. Nesting probability was greatest in island plots between 0.5 m and 1.5 m above the water surface, at distances <10 m from the water's edge, and of moderately steep (avocets) or flat (terns) slopes. Further, avocet and tern nesting probability increased as the number of nests initiated in adjacent plots increased up to a peak of 11–12 tern nests, and then decreased thereafter. Yet, avocets were less likely to nest in plots adjacent to plots with nesting avocets, suggesting an influence of intra-specific territoriality. At the smaller microhabitat scale, or the area immediately surrounding the nest, we compared topography, vegetation, and distance to nearest nest between nest sites and paired random sites. Topography had little influence on selection of the nest microhabitat. Instead, nest sites were more likely to have vegetation present, and greater cover, than random sites. Finally, avocet, and to a lesser extent tern, nest sites were closer to other active conspecific or heterospecific nests than random sites, indicating that social attraction played a role in selection of nest microhabitat. Our results demonstrate key differences in nest

Enclosed nests may provide greater thermal than nest predation benefits compared with open nests across latitudes

USGS Publications Warehouse

Martin, Thomas E.; Boyce, Andy J.; Fierro-Calderon, Karolina; Mitchell, Adam E.; Armstad, Connor E.; Mouton, James C.; Bin Soudi, Evertius E.

2017-01-01

Nest structure is thought to provide benefits that have fitness consequences for several taxa. Traditionally, reduced nest predation has been considered the primary benefit underlying evolution of nest structure, whereas thermal benefits have been considered a secondary or even non-existent factor. Yet, the relative roles of these factors on nest structures remain largely unexplored.Enclosed nests have a constructed or natural roof connected to sides that allow a restricted opening or tube entrance that provides cover in all directions except the entrance, whereas open nests are cups or platforms that are open above. We show that construction of enclosed nests is more common among songbirds (Passeriformes) in tropical and southern hemisphere regions than in north temperate regions. This geographic pattern may reflect selection from predation risk, under long-standing assumptions that nest predation rates are higher in southern regions and that enclosed nests reduce predation risk compared with open cup nests. We therefore compared nest predation rates between enclosed vs. open nests in 114 songbird species that do not nest in tree holes among five communities of coexisting birds, and for 205 non-hole-nesting species from the literature, across northern temperate, tropical, and southern hemisphere regions.Among coexisting species, enclosed nests had lower nest predation rates than open nests in two south temperate sites, but not in either of two tropical sites or a north temperate site. Nest predation did not differ between nest types at any latitude based on literature data. Among 319 species from both our field studies and the literature, enclosed nests did not show consistent benefits of reduced predation and, in fact, predation was not consistently higher in the tropics, contrary to long-standing perspectives.Thermal benefits of enclosed nests were indicated based on three indirect results. First, species that built enclosed nests were smaller than species using

High Performance Semantic Factoring of Giga-Scale Semantic Graph Databases

DOE Office of Scientific and Technical Information (OSTI.GOV)

Joslyn, Cliff A.; Adolf, Robert D.; Al-Saffar, Sinan

2010-10-04

As semantic graph database technology grows to address components ranging from extant large triple stores to SPARQL endpoints over SQL-structured relational databases, it will become increasingly important to be able to bring high performance computational resources to bear on their analysis, interpretation, and visualization, especially with respect to their innate semantic structure. Our research group built a novel high performance hybrid system comprising computational capability for semantic graph database processing utilizing the large multithreaded architecture of the Cray XMT platform, conventional clusters, and large data stores. In this paper we describe that architecture, and present the results of our deployingmore » that for the analysis of the Billion Triple dataset with respect to its semantic factors.« less

Interaction in Balanced Cross Nested Designs

NASA Astrophysics Data System (ADS)

Ramos, Paulo; Mexia, João T.; Carvalho, Francisco; Covas, Ricardo

2011-09-01

Commutative Jordan Algebras, CJA, are used in the study of mixed models obtained, through crossing and nesting, from simpler ones. In the study of cross nested models the interaction between nested factors have been systematically discarded. However this can constitutes an artificial simplification of the models. We point out that, when two crossed factors interact, such interaction is symmetric, both factors playing in it equivalent roles, while when two nested factors interact, the interaction is determined by the nesting factor. These interactions will be called interactions with nesting. In this work we present a coherent formulation of the algebraic structure of models enabling the choice of families of interactions between cross and nested factors using binary operations on CJA.

High performance semantic factoring of giga-scale semantic graph databases.

DOE Office of Scientific and Technical Information (OSTI.GOV)

al-Saffar, Sinan; Adolf, Bob; Haglin, David

2010-10-01

As semantic graph database technology grows to address components ranging from extant large triple stores to SPARQL endpoints over SQL-structured relational databases, it will become increasingly important to be able to bring high performance computational resources to bear on their analysis, interpretation, and visualization, especially with respect to their innate semantic structure. Our research group built a novel high performance hybrid system comprising computational capability for semantic graph database processing utilizing the large multithreaded architecture of the Cray XMT platform, conventional clusters, and large data stores. In this paper we describe that architecture, and present the results of our deployingmore » that for the analysis of the Billion Triple dataset with respect to its semantic factors, including basic properties, connected components, namespace interaction, and typed paths.« less

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming

NASA Astrophysics Data System (ADS)

Gutin, Gregory; Kim, Eun Jung; Soleimanfallah, Arezou; Szeider, Stefan; Yeo, Anders

The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if the given graph is bipartite with partition U ⊎ V, and each vertex in U is assigned the list {1}; this subproblem appears in the context of constraint programming as the consistency problem for the extended global cardinality constraint. We show that this subproblem is fixed-parameter tractable when parameterized by the size of the second partite set V. More generally, we show that the general factor problem for bipartite graphs, parameterized by |V |, is fixed-parameter tractable as long as all vertices in U are assigned lists of length 1, but becomes W[1]-hard if vertices in U are assigned lists of length at most 2. We establish fixed-parameter tractability by reducing the problem instance to a bounded number of acyclic instances, each of which can be solved in polynomial time by dynamic programming.

Factors associated with duck nest success in the prairie pothole region of Canada

USGS Publications Warehouse

Greenwood, Raymond J.; Sargeant, Alan B.; Johnson, Douglas H.; Cowardin, Lewis M.; Shaffer, Terry L.

1995-01-01

study area and averaged [unweighted] over all study areas) was 17% in 1982, 15% in 1983, 7% in 1984, and 14% in 1985.We estimated that predators destroyed 72% of mallard, gadwall, blue-winged teal, and northern shoveler nests and 65% of northern pintail nests. In prairie, average nest success decreased about 4 percentage points for every 10 percentage points increase in Cropland, suggesting that under conditions of 1982-85, local populations of these species probably were not stable when Cropland exceeded about 56% of available habitat. We found recent remains of 573 dead ducks during 1983-85; most were females (Anas spp.) apparently killed by predators. In some years, mallards and northern pintails were more numerous among dead ducks than we expected. More females than males were found dead among mallards and northern shovelers, suggesting higher vulnerability of females. Of factors we examined, nest-success rate appeared to be the most influential factor in determining mallard production. Nest success varied both geographically and annually.

The structure of gallery networks in the nests of termite Cubitermes spp. revealed by X-ray tomography

NASA Astrophysics Data System (ADS)

Perna, Andrea; Jost, Christian; Couturier, Etienne; Valverde, Sergi; Douady, Stéphane; Theraulaz, Guy

2008-09-01

Recent studies have introduced computer tomography (CT) as a tool for the visualisation and characterisation of insect architectures. Here, we use CT to map the three-dimensional networks of galleries inside Cubitermes nests in order to analyse them with tools from graph theory. The structure of these networks indicates that connections inside the nest are rearranged during the whole nest life. The functional analysis reveals that the final network topology represents an excellent compromise between efficient connectivity inside the nest and defence against attacking predators. We further discuss and illustrate the usefulness of CT to disentangle environmental and specific influences on nest architecture.

Integer Flows and Circuit Covers of Graphs and Signed Graphs

NASA Astrophysics Data System (ADS)

Cheng, Jian

The work in Chapter 2 is motivated by Tutte and Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {2, 3}, if (G, sigma) is (k - 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted into an integer-valued ( k + 1)-ow with a larger or the same support. We also prove that if (G, sigma) is odd-(2p+1)-edge-connected, then (G, sigma) admits a modulo circular (2 + 1/ p)-flows if and only if it admits an integer-valued circular (2 + 1/p)-flows, which improves all previous result by Xu and Zhang (DM2005), Schubert and Steffen (EJC2015), and Zhu (JCTB2015). Shortest circuit cover conjecture is one of the major open problems in graph theory. It states that every bridgeless graph G contains a set of circuits F such that each edge is contained in at least one member of F and the length of F is at most 7/5∥E(G)∥. This concept was recently generalized to signed graphs by Macajova et al. (JGT2015). In Chapter 3, we improve their upper bound from 11∥E( G)∥ to 14/3 ∥E(G)∥, and if G is 2-edgeconnected and has even negativeness, then it can be further reduced to 11/3 ∥E(G)∥. Tutte's 3-flow conjecture has been studied by many graph theorists in the last several decades. As a new approach to this conjecture, DeVos and Thomassen considered the vectors as ow values and found that there is a close relation between vector S1-flows and integer 3-NZFs. Motivated by their observation, in Chapter 4, we prove that if a graph G admits a vector S1-flow with rank at most two, then G admits an integer 3-NZF. The concept of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it

A Novel Strategy Using Factor Graphs and the Sum-Product Algorithm for Satellite Broadcast Scheduling Problems

NASA Astrophysics Data System (ADS)

Chen, Jung-Chieh

This paper presents a low complexity algorithmic framework for finding a broadcasting schedule in a low-altitude satellite system, i. e., the satellite broadcast scheduling (SBS) problem, based on the recent modeling and computational methodology of factor graphs. Inspired by the huge success of the low density parity check (LDPC) codes in the field of error control coding, in this paper, we transform the SBS problem into an LDPC-like problem through a factor graph instead of using the conventional neural network approaches to solve the SBS problem. Based on a factor graph framework, the soft-information, describing the probability that each satellite will broadcast information to a terminal at a specific time slot, is exchanged among the local processing in the proposed framework via the sum-product algorithm to iteratively optimize the satellite broadcasting schedule. Numerical results show that the proposed approach not only can obtain optimal solution but also enjoys the low complexity suitable for integral-circuit implementation.

Diversity of great gray owl nest sites and nesting habitats in California

Treesearch

Joanna X. Wu; Rodney B. Siegel; Helen L. Loffland; Morgan W. Tingley; Sarah L. Stock; Kevin N. Roberts; John J. Keane; Joseph R. Medley; Roy Bridgman; Chris Stermer

2015-01-01

The great gray owl (Strix nebulosa) is listed by the state of California as endangered, with a population estimate of fewer than 300 individuals in the state. Nest-site availability has been suggested as a limiting factor for population growth in California, but information on nest types and nesting habitat has been based on a small number of nests...

A proximity-based graph clustering method for the identification and application of transcription factor clusters.

PubMed

Spadafore, Maxwell; Najarian, Kayvan; Boyle, Alan P

2017-11-29

Transcription factors (TFs) form a complex regulatory network within the cell that is crucial to cell functioning and human health. While methods to establish where a TF binds to DNA are well established, these methods provide no information describing how TFs interact with one another when they do bind. TFs tend to bind the genome in clusters, and current methods to identify these clusters are either limited in scope, unable to detect relationships beyond motif similarity, or not applied to TF-TF interactions. Here, we present a proximity-based graph clustering approach to identify TF clusters using either ChIP-seq or motif search data. We use TF co-occurrence to construct a filtered, normalized adjacency matrix and use the Markov Clustering Algorithm to partition the graph while maintaining TF-cluster and cluster-cluster interactions. We then apply our graph structure beyond clustering, using it to increase the accuracy of motif-based TFBS searching for an example TF. We show that our method produces small, manageable clusters that encapsulate many known, experimentally validated transcription factor interactions and that our method is capable of capturing interactions that motif similarity methods might miss. Our graph structure is able to significantly increase the accuracy of motif TFBS searching, demonstrating that the TF-TF connections within the graph correlate with biological TF-TF interactions. The interactions identified by our method correspond to biological reality and allow for fast exploration of TF clustering and regulatory dynamics.

Edge compression techniques for visualization of dense directed graphs.

PubMed

Dwyer, Tim; Henry Riche, Nathalie; Marriott, Kim; Mears, Christopher

2013-12-01

We explore the effectiveness of visualizing dense directed graphs by replacing individual edges with edges connected to 'modules'-or groups of nodes-such that the new edges imply aggregate connectivity. We only consider techniques that offer a lossless compression: that is, where the entire graph can still be read from the compressed version. The techniques considered are: a simple grouping of nodes with identical neighbor sets; Modular Decomposition which permits internal structure in modules and allows them to be nested; and Power Graph Analysis which further allows edges to cross module boundaries. These techniques all have the same goal--to compress the set of edges that need to be rendered to fully convey connectivity--but each successive relaxation of the module definition permits fewer edges to be drawn in the rendered graph. Each successive technique also, we hypothesize, requires a higher degree of mental effort to interpret. We test this hypothetical trade-off with two studies involving human participants. For Power Graph Analysis we propose a novel optimal technique based on constraint programming. This enables us to explore the parameter space for the technique more precisely than could be achieved with a heuristic. Although applicable to many domains, we are motivated by--and discuss in particular--the application to software dependency analysis.

Nest-site habitat of cavity-nesting birds at the San Joaquin Experimental Range

Treesearch

Kathryn L. Purcell; Jared. Verner

2008-01-01

Detailed information about the nesting habitats of birds, including those needed for successful nesting, can provide a better understanding of the ecological factors that permit coexistence of different species and may aid in conservation efforts. From 1989 through 1994, we studied the nesting habitat of secondary cavity-nesting birds in oak woodlands at the San...

Using Artificial Nests to Study Nest Predation in Birds

ERIC Educational Resources Information Center

Belthoff, James R.

2005-01-01

A simple and effective field exercise that demonstrates factors affecting predation on bird nests is described. With instructor guidance, students in high school biology or college-level biology, ecology, animal behavior, wildlife management or ornithology laboratory courses can collaborate to design field experiments related to nest depredation.

Claw-Free Maximal Planar Graphs

DTIC Science & Technology

1989-01-01

1976, 212-223. 110] M.D. Plummer, On n-extendable graphs, Discrete Math . 31, 1980, 201-210. 1111 , A theorem on matchings in the plane, Graph Theory...in Memory of G.A. Dirac, Ann. Discrete Math . 41, North-Holland, Amsterdam, 1989, 347-354. 1121 N. Sbihi, Algorithme de recherche d’un stable de...cardinalitA maximum dans un graphe sans 6toile, Discrete Math . 29, 1980, 53-76. 1131 D. Sumner, On Tutte’s factorization theorem, Graphs and Combinatorics

Communication requirements of sparse Cholesky factorization with nested dissection ordering

NASA Technical Reports Server (NTRS)

Naik, Vijay K.; Patrick, Merrell L.

1989-01-01

Load distribution schemes for minimizing the communication requirements of the Cholesky factorization of dense and sparse, symmetric, positive definite matrices on multiprocessor systems are presented. The total data traffic in factoring an n x n sparse symmetric positive definite matrix representing an n-vertex regular two-dimensional grid graph using n exp alpha, alpha not greater than 1, processors are shown to be O(n exp 1 + alpha/2). It is O(n), when n exp alpha, alpha not smaller than 1, processors are used. Under the conditions of uniform load distribution, these results are shown to be asymptotically optimal.

Graph Embedding Techniques for Bounding Condition Numbers of Incomplete Factor Preconditioning

NASA Technical Reports Server (NTRS)

Guattery, Stephen

1997-01-01

We extend graph embedding techniques for bounding the spectral condition number of preconditioned systems involving symmetric, irreducibly diagonally dominant M-matrices to systems where the preconditioner is not diagonally dominant. In particular, this allows us to bound the spectral condition number when the preconditioner is based on an incomplete factorization. We provide a review of previous techniques, describe our extension, and give examples both of a bound for a model problem, and of ways in which our techniques give intuitive way of looking at incomplete factor preconditioners.

A graph-based approach to inequality assessment

NASA Astrophysics Data System (ADS)

Palestini, Arsen; Pignataro, Giuseppe

2016-08-01

In a population consisting of heterogeneous types, whose income factors are indicated by nonnegative vectors, policies aggregating different factors can be represented by coalitions in a cooperative game, whose characteristic function is a multi-factor inequality index. When it is not possible to form all coalitions, the feasible ones can be indicated by a graph. We redefine Shapley and Banzhaf values on graph games to deduce some properties involving the degrees of the graph vertices and marginal contributions to overall inequality. An example is finally provided based on a modified multi-factor Atkinson index.

Network-based model of the growth of termite nests

NASA Astrophysics Data System (ADS)

Eom, Young-Ho; Perna, Andrea; Fortunato, Santo; Darrouzet, Eric; Theraulaz, Guy; Jost, Christian

2015-12-01

We present a model for the growth of the transportation network inside nests of the social insect subfamily Termitinae (Isoptera, termitidae). These nests consist of large chambers (nodes) connected by tunnels (edges). The model based on the empirical analysis of the real nest networks combined with pruning (edge removal, either random or weighted by betweenness centrality) and a memory effect (preferential growth from the latest added chambers) successfully predicts emergent nest properties (degree distribution, size of the largest connected component, average path lengths, backbone link ratios, and local graph redundancy). The two pruning alternatives can be associated with different genuses in the subfamily. A sensitivity analysis on the pruning and memory parameters indicates that Termitinae networks favor fast internal transportation over efficient defense strategies against ant predators. Our results provide an example of how complex network organization and efficient network properties can be generated from simple building rules based on local interactions and contribute to our understanding of the mechanisms that come into play for the formation of termite networks and of biological transportation networks in general.

Factors influencing nest survival and productivity of Red-throated Loons (Gavia stellata) in Alaska

USGS Publications Warehouse

Rizzolo, Daniel; Schmutz, Joel A.; McCloskey, Sarah E.; Fondell, Thomas F.

2014-01-01

Red-throated Loon (Gavia stellata) numbers in Alaska have fluctuated dramatically over the past 3 decades; however, the demographic processes contributing to these population dynamics are poorly understood. To examine spatial and temporal variation in productivity, we estimated breeding parameters at 5 sites in Alaska: at Cape Espenberg and the Copper River Delta we estimated nest survival, and at 3 sites within the Yukon-Kuskokwim Delta we estimated nest survival and productivity. Nest survival varied broadly among sites and years; annual estimates (lower, upper 95% confidence interval) ranged from 0.09 (0.03, 0.29) at Cape Espenberg in 2001 to 0.93 (0.76, 0.99) at the Copper River Delta in 2002. Annual variation among sites was not concordant, suggesting that site-scale factors had a strong influence on nest survival. Models of nest survival indicated that visits to monitor nests had a negative effect on nest daily survival probability, which if not accounted for biased nest survival strongly downward. The sensitivity of breeding Red-throated Loons to nest monitoring suggests other sources of disturbance that cause incubating birds to flush from their nests may also reduce nest survival. Nest daily survival probability at the Yukon-Kuskokwim Delta was negatively associated with an annual index of fox occurrence. Survival through the incubation and chick-rearing periods on the Yukon-Kuskokwim Delta ranged from 0.09 (0.001, 0.493) to 0.50 (0.04, 0.77). Daily survival probability during the chick-rearing period was lower for chicks that had a sibling in 2 of 3 years, consistent with the hypothesis that food availability was limited. Estimates of annual productivity on the Yukon-Kuskokwim Delta ranged from 0.17 to 1.0 chicks per pair. Productivity was not sufficient to maintain population stability in 2 of 3 years, indicating that nest depredation by foxes and poor foraging conditions during chick rearing can have important effects on productivity.

Adjusting protein graphs based on graph entropy.

PubMed

Peng, Sheng-Lung; Tsay, Yu-Wei

2014-01-01

Measuring protein structural similarity attempts to establish a relationship of equivalence between polymer structures based on their conformations. In several recent studies, researchers have explored protein-graph remodeling, instead of looking a minimum superimposition for pairwise proteins. When graphs are used to represent structured objects, the problem of measuring object similarity become one of computing the similarity between graphs. Graph theory provides an alternative perspective as well as efficiency. Once a protein graph has been created, its structural stability must be verified. Therefore, a criterion is needed to determine if a protein graph can be used for structural comparison. In this paper, we propose a measurement for protein graph remodeling based on graph entropy. We extend the concept of graph entropy to determine whether a graph is suitable for representing a protein. The experimental results suggest that when applied, graph entropy helps a conformational on protein graph modeling. Furthermore, it indirectly contributes to protein structural comparison if a protein graph is solid.

Adjusting protein graphs based on graph entropy

PubMed Central

2014-01-01

Measuring protein structural similarity attempts to establish a relationship of equivalence between polymer structures based on their conformations. In several recent studies, researchers have explored protein-graph remodeling, instead of looking a minimum superimposition for pairwise proteins. When graphs are used to represent structured objects, the problem of measuring object similarity become one of computing the similarity between graphs. Graph theory provides an alternative perspective as well as efficiency. Once a protein graph has been created, its structural stability must be verified. Therefore, a criterion is needed to determine if a protein graph can be used for structural comparison. In this paper, we propose a measurement for protein graph remodeling based on graph entropy. We extend the concept of graph entropy to determine whether a graph is suitable for representing a protein. The experimental results suggest that when applied, graph entropy helps a conformational on protein graph modeling. Furthermore, it indirectly contributes to protein structural comparison if a protein graph is solid. PMID:25474347

Factors affecting chick provisioning by Caspian Terns nesting in the Columbia River estuary

USGS Publications Warehouse

Anderson, Scott K.; Roby, D.D.; Lyons, Donald E.; Collis, K.

2005-01-01

We investigated factors affecting chick provisioning by radio-tagged Caspian Terns (Sterna caspia) nesting in a large colony on East Sand Island in the Columbia River estuary during 2001. Caspian Tern predation on juvenile salmonids (Oncorhynchus spp.) in the estuary prompted resource managers to relocate ca. 9,000 pairs of terns nesting on Rice Island (river km 34) to East Sand Island (river km 8), where terns were expected to consume fewer salmonids in favor of marine forage fishes. This study investigated factors influencing foraging success, diet composition, and overall reproductive success at the managed Caspian Tern colony. Our results indicated that daytime colony attendance by nesting terns averaged 64% and decreased throughout the chick-rearing period, while duration of foraging trips averaged 47 min and increased during the same period; these seasonal changes were more strongly related to date than chick age. Average meal delivery rates to 2-chick broods (0.88 meals h-1) were 2.6 times greater than to 1-chick broods (0.33 meals h-1). Parents delivered more juvenile salmonids to chicks during ebb tides than flood tides, but meal delivery rates to the nest remained constant, suggesting diet composition tracks relative availability of prey species. Foraging trips resulting in delivery of juvenile salmonids averaged 68% longer than foraging trips for schooling marine forage fishes, indicating higher availability of marine prey near the colony. High availability of marine forage fish in the Columbia River estuary during 2001 was apparently responsible for high colony attendance, short foraging trips, high chick meal delivery rates, and high nesting success of Caspian Terns on East Sand Island.

Why wasp foundresses change nests: relatedness, dominance, and nest quality.

PubMed

Seppä, Perttu; Queller, David C; Strassmann, Joan E

2012-01-01

The costs and benefits of different social options are best understood when individuals can be followed as they make different choices, something that can be difficult in social insects. In this detailed study, we follow overwintered females of the social wasp Polistes carolina through different nesting strategies in a stratified habitat where nest site quality varies with proximity to a foraging area, and genetic relatedness among females is known. Females may initiate nests, join nests temporarily or permanently, or abandon nests. Females can become helpers or egglayers, effectively workers or queens. What they actually do can be predicted by a combination of ecological and relatedness factors. Advantages through increased lifetime success of individuals and nests drives foundresses of the social wasp Polistes from solitary to social nest founding. We studied reproductive options of spring foundresses of P. carolina by monitoring individually-marked wasps and assessing reproductive success of each foundress by using DNA microsatellites. We examined what behavioral decisions foundresses make after relaxing a strong ecological constraint, shortage of nesting sites. We also look at the reproductive consequences of different behaviors. As in other Polistes, the most successful strategy for a foundress was to initiate a nest as early as possible and then accept others as subordinates. A common feature for many P. carolina foundresses was, however, that they reassessed their reproductive options by actively monitoring other nests at the field site and sometimes moving permanently to new nests should that offer better (inclusive) fitness prospects compared to their original nests. A clear motivation for moving to new nests was high genetic relatedness; by the end of the foundress period all females were on nests with full sisters.

Adaptive nest clustering and density-dependent nest survival in dabbling ducks

USGS Publications Warehouse

Ringelman, Kevin M.; Eadie, John M.; Ackerman, Joshua T.

2014-01-01

Density-dependent population regulation is observed in many taxa, and understanding the mechanisms that generate density dependence is especially important for the conservation of heavily-managed species. In one such system, North American waterfowl, density dependence is often observed at continental scales, and nest predation has long been implicated as a key factor driving this pattern. However, despite extensive research on this topic, it remains unclear if and how nest density influences predation rates. Part of this confusion may have arisen because previous studies have studied density-dependent predation at relatively large spatial and temporal scales. Because the spatial distribution of nests changes throughout the season, which potentially influences predator behavior, nest survival may vary through time at relatively small spatial scales. As such, density-dependent nest predation might be more detectable at a spatially- and temporally-refined scale and this may provide new insights into nest site selection and predator foraging behavior. Here, we used three years of data on nest survival of two species of waterfowl, mallards and gadwall, to more fully explore the relationship between local nest clustering and nest survival. Throughout the season, we found that the distribution of nests was consistently clustered at small spatial scales (˜50–400 m), especially for mallard nests, and that this pattern was robust to yearly variation in nest density and the intensity of predation. We demonstrated further that local nest clustering had positive fitness consequences – nests with closer nearest neighbors were more likely to be successful, a result that is counter to the general assumption that nest predation rates increase with nest density.

Marsh nesting by mallards

USGS Publications Warehouse

Krapu, G.L.; Talent, L.G.; Dwyer, T.J.

1979-01-01

Nest-site selection by mallard (Anas platyrhynchos) hens was studied on a 52-km2, privately owned area in the Missouri Coteau of south-central North Dakota during 1974-77. Sixty-six percent of 53 nests initiated by radio-marked and unmarked hens were in wetlands in dense stands of emergent vegetation and usually within 50 m of the wetland edge. These findings and other sources of information suggest that significant numbers of mallards breeding in the Prairie Pothole Region nest in marsh habitat. Potential factors contributing to mallard use of marsh habitat for nesting purposes are discussed. Management considerations associated with marsh nesting by mallards are described and research needs are identified.

Calculating massive 3-loop graphs for operator matrix elements by the method of hyperlogarithms

NASA Astrophysics Data System (ADS)

Ablinger, Jakob; Blümlein, Johannes; Raab, Clemens; Schneider, Carsten; Wißbrock, Fabian

2014-08-01

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist τ=2 local operator insertions corresponding to spin N. They contribute to the massive operator matrix elements in QCD describing the massive Wilson coefficients for deep-inelastic scattering at large virtualities. Diagrams of this kind can be computed using an extended version of the method of hyperlogarithms, originally being designed for massless Feynman diagrams without operators. The method is applied to Benz- and V-type graphs, belonging to the genuine 3-loop topologies. In case of the V-type graphs with five massive propagators, new types of nested sums and iterated integrals emerge. The sums are given in terms of finite binomially and inverse binomially weighted generalized cyclotomic sums, while the 1-dimensionally iterated integrals are based on a set of ∼30 square-root valued letters. We also derive the asymptotic representations of the nested sums and present the solution for N∈C. Integrals with a power-like divergence in N-space ∝aN,a∈R,a>1, for large values of N emerge. They still possess a representation in x-space, which is given in terms of root-valued iterated integrals in the present case. The method of hyperlogarithms is also used to calculate higher moments for crossed box graphs with different operator insertions.

Use of artificial nests to investigate predation on freshwater turtle nests

Treesearch

Michael N. Marchand; John A. Litvaitis; Thomas J. Maier; Richard M. DeGraaf

2002-01-01

Habitat fragmentation has raised concerns that populations of generalist predators have increased and are affecting a diverse group of prey. Previous research has included the use of artificial nests to investigate the role of predation on birds that nest on or near the ground. Because predation also is a major factor limiting populations of freshwater turtles, we...

Graphs, matrices, and the GraphBLAS: Seven good reasons

DOE PAGES

Kepner, Jeremy; Bader, David; Buluç, Aydın; ...

2015-01-01

The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implementmore » a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.« less

Collaborative Robotic Instruction: A Graph Teaching Experience

ERIC Educational Resources Information Center

Mitnik, Ruben; Recabarren, Matias; Nussbaum, Miguel; Soto, Alvaro

2009-01-01

Graphing is a key skill in the study of Physics. Drawing and interpreting graphs play a key role in the understanding of science, while the lack of these has proved to be a handicap and a limiting factor in the learning of scientific concepts. It has been observed that despite the amount of previous graph-working experience, students of all ages…

Bayesian segmentation of atrium wall using globally-optimal graph cuts on 3D meshes.

PubMed

Veni, Gopalkrishna; Fu, Zhisong; Awate, Suyash P; Whitaker, Ross T

2013-01-01

Efficient segmentation of the left atrium (LA) wall from delayed enhancement MRI is challenging due to inconsistent contrast, combined with noise, and high variation in atrial shape and size. We present a surface-detection method that is capable of extracting the atrial wall by computing an optimal a-posteriori estimate. This estimation is done on a set of nested meshes, constructed from an ensemble of segmented training images, and graph cuts on an associated multi-column, proper-ordered graph. The graph/mesh is a part of a template/model that has an associated set of learned intensity features. When this mesh is overlaid onto a test image, it produces a set of costs which lead to an optimal segmentation. The 3D mesh has an associated weighted, directed multi-column graph with edges that encode smoothness and inter-surface penalties. Unlike previous graph-cut methods that impose hard constraints on the surface properties, the proposed method follows from a Bayesian formulation resulting in soft penalties on spatial variation of the cuts through the mesh. The novelty of this method also lies in the construction of proper-ordered graphs on complex shapes for choosing among distinct classes of base shapes for automatic LA segmentation. We evaluate the proposed segmentation framework on simulated and clinical cardiac MRI.

Discrete geometric analysis of message passing algorithm on graphs

NASA Astrophysics Data System (ADS)

Watanabe, Yusuke

2010-04-01

We often encounter probability distributions given as unnormalized products of non-negative functions. The factorization structures are represented by hypergraphs called factor graphs. Such distributions appear in various fields, including statistics, artificial intelligence, statistical physics, error correcting codes, etc. Given such a distribution, computations of marginal distributions and the normalization constant are often required. However, they are computationally intractable because of their computational costs. One successful approximation method is Loopy Belief Propagation (LBP) algorithm. The focus of this thesis is an analysis of the LBP algorithm. If the factor graph is a tree, i.e. having no cycle, the algorithm gives the exact quantities. If the factor graph has cycles, however, the LBP algorithm does not give exact results and possibly exhibits oscillatory and non-convergent behaviors. The thematic question of this thesis is "How the behaviors of the LBP algorithm are affected by the discrete geometry of the factor graph?" The primary contribution of this thesis is the discovery of a formula that establishes the relation between the LBP, the Bethe free energy and the graph zeta function. This formula provides new techniques for analysis of the LBP algorithm, connecting properties of the graph and of the LBP and the Bethe free energy. We demonstrate applications of the techniques to several problems including (non) convexity of the Bethe free energy, the uniqueness and stability of the LBP fixed point. We also discuss the loop series initiated by Chertkov and Chernyak. The loop series is a subgraph expansion of the normalization constant, or partition function, and reflects the graph geometry. We investigate theoretical natures of the series. Moreover, we show a partial connection between the loop series and the graph zeta function.

Discovery of a new Kittlitz's murrelet nest: Clues to habitat selection and nest-site fidelity

USGS Publications Warehouse

Piatt, John F.; Naslund, Nancy L.; van Pelt, Thomas I.

1999-01-01

On 13 June 1993, a new Kittlitz's murrelet (Brachyramphus brevirostris) nest was discovered near Red Mountain on the Kenai Peninsula, Alaska. The nest was on a 22° slope at about 900 m elevation with a northeast aspect, and contained a 60.2 × 40.6 mm egg that weighed 49.0 g. Downy feathers and weathered fecal material found at the nest indicated re-use from a previous year, suggesting possible nest site fidelity. The nest was located in an area scoured by winds and free of snow during early spring, suggesting that this may be an important mesoscale factor influencing selection of nesting habitat. Proximity to suitable foraging habitat, particularly sheltered bays and glacial river outflows, may affect breeding habitat choice over larger spatial scales.

GraphBench

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sukumar, Sreenivas R.; Hong, Seokyong; Lee, Sangkeun

2016-06-01

GraphBench is a benchmark suite for graph pattern mining and graph analysis systems. The benchmark suite is a significant addition to conducting apples-apples comparison of graph analysis software (databases, in-memory tools, triple stores, etc.)

Advanced techniques for modeling avian nest survival

USGS Publications Warehouse

Dinsmore, S.J.; White, Gary C.; Knopf, F.L.

2002-01-01

Estimation of avian nest survival has traditionally involved simple measures of apparent nest survival or Mayfield constant-nest-survival models. However, these methods do not allow researchers to build models that rigorously assess the importance of a wide range of biological factors that affect nest survival. Models that incorporate greater detail, such as temporal variation in nest survival and covariates representative of individual nests represent a substantial improvement over traditional estimation methods. In an attempt to improve nest survival estimation procedures, we introduce the nest survival model now available in the program MARK and demonstrate its use on a nesting study of Mountain Plovers (Charadrius montanus Townsend) in Montana, USA. We modeled the daily survival of Mountain Plover nests as a function of the sex of the incubating adult, nest age, year, linear and quadratic time trends, and two weather covariates (maximum daily temperature and daily precipitation) during a six-year study (1995–2000). We found no evidence for yearly differences or an effect of maximum daily temperature on the daily nest survival of Mountain Plovers. Survival rates of nests tended by female and male plovers differed (female rate = 0.33; male rate = 0.49). The estimate of the additive effect for males on nest survival rate was 0.37 (95% confidence limits were 0.03, 0.71) on a logit scale. Daily survival rates of nests increased with nest age; the estimate of daily nest-age change in survival in the best model was 0.06 (95% confidence limits were 0.04, 0.09) on a logit scale. Daily precipitation decreased the probability that the nest would survive to the next day; the estimate of the additive effect of daily precipitation on the nest survival rate was −1.08 (95% confidence limits were −2.12, −0.13) on a logit scale. Our approach to modeling daily nest-survival rates allowed several biological factors of interest to be easily included in nest survival models

Differentials on graph complexes II: hairy graphs

NASA Astrophysics Data System (ADS)

Khoroshkin, Anton; Willwacher, Thomas; Živković, Marko

2017-10-01

We study the cohomology of the hairy graph complexes which compute the rational homotopy of embedding spaces, generalizing the Vassiliev invariants of knot theory. We provide spectral sequences converging to zero whose first pages contain the hairy graph cohomology. Our results yield a way to construct many nonzero hairy graph cohomology classes out of (known) non-hairy classes by studying the cancellations in those sequences. This provide a first glimpse at the tentative global structure of the hairy graph cohomology.

Genetic algorithm and graph theory based matrix factorization method for online friend recommendation.

PubMed

Li, Qu; Yao, Min; Yang, Jianhua; Xu, Ning

2014-01-01

Online friend recommendation is a fast developing topic in web mining. In this paper, we used SVD matrix factorization to model user and item feature vector and used stochastic gradient descent to amend parameter and improve accuracy. To tackle cold start problem and data sparsity, we used KNN model to influence user feature vector. At the same time, we used graph theory to partition communities with fairly low time and space complexity. What is more, matrix factorization can combine online and offline recommendation. Experiments showed that the hybrid recommendation algorithm is able to recommend online friends with good accuracy.

Spawning chronology, nest site selection and nest success of smallmouth bass during benign streamflow conditions

USGS Publications Warehouse

Dauwalter, D.C.; Fisher, W.L.

2007-01-01

We documented the nesting chronology, nest site selection and nest success of smallmouth bass Micropterus dolomieu in an upstream (4th order) and downstream (5th order) reach of Baron Fork Creek, Oklahoma. Males started nesting in mid-Apr. when water temperatures increased to 16.9 C upstream, and in late-Apr. when temperatures increased to 16.2 C downstream. Streamflows were low (77% upstream to 82% downstream of mean Apr. streamflow, and 12 and 18% of meanjun. streamflow; 47 and 55 y of record), and decreased throughout the spawning period. Larger males nested first upstream, as has been observed in other populations, but not downstream. Upstream, progeny in 62 of 153 nests developed to swim-up stage. Downstream, progeny in 31 of 73 nests developed to swim-up. Nesting densities upstream (147/km) and downstream (100/km) were both higher than any densities previously reported. Males selected nest sites with intermediate water depths, low water velocity and near cover, behavior that is typical of smallmouth bass. Documented nest failures resulted from human disturbance, angling, and longear sunfish predation. Logistic exposure models showed that water velocity at the nest was negatively related and length of the guarding male was positively related to nest success upstream. Male length and number of degree days were both positively related to nest success downstream. Our results, and those of other studies, suggest that biological factors account for most nest failures during benign (stable, low flow) streamflow conditions, whereas nest failures attributed to substrate mobility or nest abandonment dominate when harsh streamflow conditions (spring floods) coincide with the spawning season.

Nest site characteristics and nesting success of the Western Burrowing Owl in the eastern Mojave Desert

USGS Publications Warehouse

Longshore, Kathleen M.; Crowe, Dorothy E.

2013-01-01

We evaluated nest site selection at two spatial scales (microsite, territory) and reproductive success of Western Burrowing Owls (Athene cunicularia hypugaea) at three spatial scales (microsite, territory, landscape) in the eastern Mojave Desert. We used binary logistic regression within an information-theoretic approach to assess factors influencing nest site choice and nesting success. Microsite-scale variables favored by owls included burrows excavated by desert tortoise (Gopherus agassizii), burrows with a large mound of excavated soil at the entrance, and a greater number of satellite burrows within 5 m of the nest burrow. At the territory scale, owls preferred patches with greater cover of creosote bush (Larrea tridentata) within 50 m of the nest burrow. An interaction between the presence or absence of a calcic soil horizon layer over the top of the burrow (microsite) and the number of burrows within 50 m (territory) influenced nest site choice. Nesting success was influenced by a greater number of burrows within 5 m of the nest burrow. Total cool season precipitation was a predictor of nesting success at the landscape scale. Conservation strategies can rely on management of habitat for favored and productive nesting sites for this declining species.

GraphReduce: Processing Large-Scale Graphs on Accelerator-Based Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sengupta, Dipanjan; Song, Shuaiwen; Agarwal, Kapil

2015-11-15

Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the host andmore » device.« less

Buteo Nesting Ecology: Evaluating Nesting of Swainson's Hawks in the Northern Great Plains.

PubMed

Inselman, Will M; Datta, Shubham; Jenks, Jonathan A; Jensen, Kent C; Grovenburg, Troy W

2015-01-01

Swainson's hawks (Buteo swainsoni) are long-distance migratory raptors that nest primarily in isolated trees located in areas of high grassland density. In recent years, anthropogenic conversion of grassland habitat has raised concerns about the status of the breeding population in the northern Great Plains. In 2013, we initiated a study to investigate the influence of extrinsic factors influencing Swainson's hawk nesting ecology in north-central South Dakota and south-central North Dakota. Using ground and aerial surveys, we located and monitored nesting Swainson's hawk pairs: 73 in 2013 and 120 in 2014. We documented 98 successful breeding attempts that fledged 163 chicks; 1.52 and 1.72 fledglings per successful nest in 2013 and 2014, respectively. We used Program MARK to evaluate the influence of land cover on nest survival. The top model, SDist2Farm+%Hay, indicated that nest survival (fledging at least one chick) decreased as nests were located farther from farm sites and as the percent of hay cover increased within 1200-m of the nest site (34.4%; 95% CI = 27.6%-42.3%). We used logistic regression analysis to evaluate the influence of landscape variables on nest-site selection; Swainson's hawks selected for nest sites located closer to roads. We suggest that tree belts associated with farm sites, whether occupied or not, provide critical breeding sites for Swainson's hawks. Additionally, poor breeding success may be related to the late migratory behavior of this species which requires them to occupy marginal habitat due to other raptors occupying the most suitable habitat prior to Swainson's hawks arriving to the breeding grounds.

Assessing and Understanding Line Graph Interpretations Using a Scoring Rubric of Organized Cited Factors

ERIC Educational Resources Information Center

Boote, Stacy K.

2014-01-01

This study examined how 12- and 13-year-old students' mathematics and science background knowledge affected line graph interpretations and how interpretations were affected by graph question levels. A purposive sample of 14 students engaged in think aloud interviews while completing an excerpted Test of Graphing in Science. Data were…

Density-dependent nest predation in waterfowl: the relative importance of nest density versus nest dispersion

USGS Publications Warehouse

Ackerman, Joshua T.; Ringelman, Kevin M.; Eadie, J.M.

2012-01-01

When nest predation levels are very high or very low, the absolute range of observable nest success is constrained (a floor/ceiling effect), and it may be more difficult to detect density-dependent nest predation. Density-dependent nest predation may be more detectable in years with moderate predation rates, simply because there can be a greater absolute difference in nest success between sites. To test this, we replicated a predation experiment 10 years after the original study, using both natural and artificial nests, comparing a year when overall rates of nest predation were high (2000) to a year with moderate nest predation (2010). We found no evidence for density-dependent predation on artificial nests in either year, indicating that nest predation is not density-dependent at the spatial scale of our experimental replicates (1-ha patches). Using nearest-neighbor distances as a measure of nest dispersion, we also found little evidence for “dispersion-dependent” predation on artificial nests. However, when we tested for dispersion-dependent predation using natural nests, we found that nest survival increased with shorter nearest-neighbor distances, and that neighboring nests were more likely to share the same nest fate than non-adjacent nests. Thus, at small spatial scales, density-dependence appears to operate in the opposite direction as predicted: closer nearest neighbors are more likely to be successful. We suggest that local nest dispersion, rather than larger-scale measures of nest density per se, may play a more important role in density-dependent nest predation.

Toward the optimization of normalized graph Laplacian.

PubMed

Xie, Bo; Wang, Meng; Tao, Dacheng

2011-04-01

Normalized graph Laplacian has been widely used in many practical machine learning algorithms, e.g., spectral clustering and semisupervised learning. However, all of them use the Euclidean distance to construct the graph Laplacian, which does not necessarily reflect the inherent distribution of the data. In this brief, we propose a method to directly optimize the normalized graph Laplacian by using pairwise constraints. The learned graph is consistent with equivalence and nonequivalence pairwise relationships, and thus it can better represent similarity between samples. Meanwhile, our approach, unlike metric learning, automatically determines the scale factor during the optimization. The learned normalized Laplacian matrix can be directly applied in spectral clustering and semisupervised learning algorithms. Comprehensive experiments demonstrate the effectiveness of the proposed approach.

The importance of illumination in nest site choice and nest characteristics of cavity nesting birds.

PubMed

Podkowa, Paweł; Surmacki, Adrian

2017-05-02

Light has a significant impact on many aspects of avian biology, physiology and behaviour. An increasing number of studies show that illumination may positively influences birds' offspring fitness by e.g. acceleration of embryo development, stimulation of skeleton growth or regulation of circadian rhythm. Because nest cavities have especially low illumination, suitable light levels may be especially important for species which nest there. We may therefore expect that birds breeding in relatively dim conditions should prefer brighter nest sites and/or evolve behavioral mechanisms to secure sufficient light levels in the nest. Using nest boxes with modified internal illumination, we experimentally tested whether light regime is a cue for nest site selection of secondary cavity-nesting species. Additionally, we investigated whether nest building strategies are tuned to internal illumination. Our results demonstrate that, nest boxes with elevated illumination were chosen twice as often as dark nest boxes. Moreover, birds built higher nests in dark nest boxes than birds in boxes with elevated illumination, which suggests a mechanism of compensating for low light conditions. Our results provide the first experimental support for the idea that nest site choice and nest building behaviour in cavity-nesting birds are influenced by ambient illumination.

Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?

ERIC Educational Resources Information Center

Öçal, Mehmet Fatih

2017-01-01

Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students' learning during graphing functions. However, the display of graphs of functions that students sketched by hand may…

Catastrophic health expenditure: a comparative analysis of empty-nest and non-empty-nest households with seniors in Shandong, China

PubMed Central

Yang, Tingting; Chu, Jie; Zhou, Chengchao; Medina, Alexis; Li, Cuicui; Jiang, Shan; Zheng, Wengui; Sun, Liyuan; Liu, Jing

2016-01-01

Objective The aim of this study was to compare the catastrophic health expenditure (CHE) prevalence and its determinants between empty-nest and non-empty-nest elderly households. Setting Shandong province of China. Participants A total of 2761 elderly households are included in the analysis. Results CHE incidence among elderly households was 44.9%. The CHE incidence of empty-nest singles (59.3%, p=0.000, OR=3.19) and empty-nest couples (52.9%, p=0.000, OR=2.45) are both statistically higher than that of non-empty-nest elderly households (31.4%). An inverse association was observed between CHE incidence and income level in all elderly household types. Factors including 1 or more household elderly members with non-communicable chronic diseases in the past 6 months, 1 or more elderly household members being hospitalised in the past year and lower household income, are significant risk factors for CHE in all 3 household types (p<0.05). Health insurance status was found to be a significant determinant of CHE among empty-nest singles and non-empty-nest households (p<0.05). Conclusions CHE incidence among elderly households is high in China. Empty-nest households are at higher risk for CHE than non-empty-nest households. Based on these findings, we suggest that special insurance be developed to broaden the coverage of health services and heighten the reimbursement rate for empty-nest elderly in the existing health insurance schemes. Financial and social protection interventions are also essential for identified at-risk subgroups among different types of elderly households. PMID:27381206

Evaluation of Graph Pattern Matching Workloads in Graph Analysis Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hong, Seokyong; Lee, Sangkeun; Lim, Seung-Hwan

2016-01-01

Graph analysis has emerged as a powerful method for data scientists to represent, integrate, query, and explore heterogeneous data sources. As a result, graph data management and mining became a popular area of research, and led to the development of plethora of systems in recent years. Unfortunately, the number of emerging graph analysis systems and the wide range of applications, coupled with a lack of apples-to-apples comparisons, make it difficult to understand the trade-offs between different systems and the graph operations for which they are designed. A fair comparison of these systems is a challenging task for the following reasons:more » multiple data models, non-standardized serialization formats, various query interfaces to users, and diverse environments they operate in. To address these key challenges, in this paper we present a new benchmark suite by extending the Lehigh University Benchmark (LUBM) to cover the most common capabilities of various graph analysis systems. We provide the design process of the benchmark, which generalizes the workflow for data scientists to conduct the desired graph analysis on different graph analysis systems. Equipped with this extended benchmark suite, we present performance comparison for nine subgraph pattern retrieval operations over six graph analysis systems, namely NetworkX, Neo4j, Jena, Titan, GraphX, and uRiKA. Through the proposed benchmark suite, this study reveals both quantitative and qualitative findings in (1) implications in loading data into each system; (2) challenges in describing graph patterns for each query interface; and (3) different sensitivity of each system to query selectivity. We envision that this study will pave the road for: (i) data scientists to select the suitable graph analysis systems, and (ii) data management system designers to advance graph analysis systems.« less

Structure and strategy in encoding simplified graphs

NASA Technical Reports Server (NTRS)

Schiano, Diane J.; Tversky, Barbara

1992-01-01

Tversky and Schiano (1989) found a systematic bias toward the 45-deg line in memory for the slopes of identical lines when embedded in graphs, but not in maps, suggesting the use of a cognitive reference frame specifically for encoding meaningful graphs. The present experiments explore this issue further using the linear configurations alone as stimuli. Experiments 1 and 2 demonstrate that perception and immediate memory for the slope of a test line within orthogonal 'axes' are predictable from purely structural considerations. In Experiments 3 and 4, subjects were instructed to use a diagonal-reference strategy in viewing the stimuli, which were described as 'graphs' only in Experiment 3. Results for both studies showed the diagonal bias previously found only for graphs. This pattern provides converging evidence for the diagonal as a cognitive reference frame in encoding linear graphs, and demonstrates that even in highly simplified displays, strategic factors can produce encoding biases not predictable solely from stimulus structure alone.

Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph

NASA Astrophysics Data System (ADS)

Nagarathinam, R.; Parvathi, N.

2018-04-01

Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat

Partitioning sparse matrices with eigenvectors of graphs

NASA Technical Reports Server (NTRS)

Pothen, Alex; Simon, Horst D.; Liou, Kang-Pu

1990-01-01

The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

Lamplighter groups, de Brujin graphs, spider-web graphs and their spectra

NASA Astrophysics Data System (ADS)

Grigorchuk, R.; Leemann, P.-H.; Nagnibeda, T.

2016-05-01

We study the infinite family of spider-web graphs \\{{{ S }}k,N,M\\}, k≥slant 2, N≥slant 0 and M≥slant 1, initiated in the 50s in the context of network theory. It was later shown in physical literature that these graphs have remarkable percolation and spectral properties. We provide a mathematical explanation of these properties by putting the spider-web graphs in the context of group theory and algebraic graph theory. Namely, we realize them as tensor products of the well-known de Bruijn graphs \\{{{ B }}k,N\\} with cyclic graphs \\{{C}M\\} and show that these graphs are described by the action of the lamplighter group {{ L }}k={Z}/k{Z}\\wr {Z} on the infinite binary tree. Our main result is the identification of the infinite limit of \\{{{ S }}k,N,M\\}, as N,M\\to ∞ , with the Cayley graph of the lamplighter group {{ L }}k which, in turn, is one of the famous Diestel-Leader graphs {{DL}}k,k. As an application we compute the spectra of all spider-web graphs and show their convergence to the discrete spectral distribution associated with the Laplacian on the lamplighter group.

GraphReduce: Large-Scale Graph Analytics on Accelerator-Based HPC Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sengupta, Dipanjan; Agarwal, Kapil; Song, Shuaiwen

2015-09-30

Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of both edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the hostmore » and the device.« less

Buteo Nesting Ecology: Evaluating Nesting of Swainson’s Hawks in the Northern Great Plains

PubMed Central

Inselman, Will M.; Datta, Shubham; Jenks, Jonathan A.; Jensen, Kent C.; Grovenburg, Troy W.

2015-01-01

Swainson’s hawks (Buteo swainsoni) are long-distance migratory raptors that nest primarily in isolated trees located in areas of high grassland density. In recent years, anthropogenic conversion of grassland habitat has raised concerns about the status of the breeding population in the northern Great Plains. In 2013, we initiated a study to investigate the influence of extrinsic factors influencing Swainson’s hawk nesting ecology in north-central South Dakota and south-central North Dakota. Using ground and aerial surveys, we located and monitored nesting Swainson’s hawk pairs: 73 in 2013 and 120 in 2014. We documented 98 successful breeding attempts that fledged 163 chicks; 1.52 and 1.72 fledglings per successful nest in 2013 and 2014, respectively. We used Program MARK to evaluate the influence of land cover on nest survival. The top model, S Dist2Farm+%Hay, indicated that nest survival (fledging at least one chick) decreased as nests were located farther from farm sites and as the percent of hay cover increased within 1200-m of the nest site (34.4%; 95% CI = 27.6%–42.3%). We used logistic regression analysis to evaluate the influence of landscape variables on nest-site selection; Swainson’s hawks selected for nest sites located closer to roads. We suggest that tree belts associated with farm sites, whether occupied or not, provide critical breeding sites for Swainson’s hawks. Additionally, poor breeding success may be related to the late migratory behavior of this species which requires them to occupy marginal habitat due to other raptors occupying the most suitable habitat prior to Swainson’s hawks arriving to the breeding grounds. PMID:26327440

Nest and nest site characteristics of some ground-nesting, non-passerine birds of northern grasslands

USGS Publications Warehouse

Kantrud, Harold A.; Higgins, Kenneth F.

1992-01-01

We summarized biological and ecologic characteristics of 2490 nests of 16 species of upland-nesting, non-passerine birds of northern grasslands found during 1963 through 1991. Nest initiation and hatch dates, clutch sizes, nest fates, causes of failure, success rates of nests among major habitat types and land uses, and vegetation measurements at nest sites are analyzed.

Graphing Polar Curves

ERIC Educational Resources Information Center

Lawes, Jonathan F.

2013-01-01

Graphing polar curves typically involves a combination of three traditional techniques, all of which can be time-consuming and tedious. However, an alternative method--graphing the polar function on a rectangular plane--simplifies graphing, increases student understanding of the polar coordinate system, and reinforces graphing techniques learned…

Graph Coarsening for Path Finding in Cybersecurity Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh

2013-01-01

n the pass-the-hash attack, hackers repeatedly steal password hashes and move through a computer network with the goal of reaching a computer with high level administrative privileges. In this paper we apply graph coarsening in network graphs for the purpose of detecting hackers using this attack or assessing the risk level of the network's current state. We repeatedly take graph minors, which preserve the existence of paths in the graph, and take powers of the adjacency matrix to count the paths. This allows us to detect the existence of paths as well as find paths that have high risk ofmore » being used by adversaries.« less

Convex Graph Invariants

DTIC Science & Technology

2010-12-02

Motzkin, T. and Straus, E. (1965). Maxima for graphs and a new proof of a theorem of Turan . Canad. J. Math. 17 533–540. [33] Rendl, F. and Sotirov, R...Convex Graph Invariants Venkat Chandrasekaran, Pablo A . Parrilo, and Alan S. Willsky ∗ Laboratory for Information and Decision Systems Department of...this paper we study convex graph invariants, which are graph invariants that are convex functions of the adjacency matrix of a graph. Some examples

Interval Graph Limits

PubMed Central

Diaconis, Persi; Holmes, Susan; Janson, Svante

2015-01-01

We work out a graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function W (x, y) on the unit square, with x and y uniform on the interval (0, 1). Instead, we fix a W and change the underlying distribution of the coordinates x and y. We find choices such that our limits are continuous. Connections to random interval graphs are given, including some examples. We also show a continuity result for the chromatic number and clique number of interval graphs. Some results on uniqueness of the limit description are given for general graph limits. PMID:26405368

Identifying Key Drivers of Return Reversal with Dynamical Bayesian Factor Graph

PubMed Central

Zhao, Shuai; Tong, Yunhai; Wang, Zitian; Tan, Shaohua

2016-01-01

In the stock market, return reversal occurs when investors sell overbought stocks and buy oversold stocks, reversing the stocks’ price trends. In this paper, we develop a new method to identify key drivers of return reversal by incorporating a comprehensive set of factors derived from different economic theories into one unified dynamical Bayesian factor graph. We then use the model to depict factor relationships and their dynamics, from which we make some interesting discoveries about the mechanism behind return reversals. Through extensive experiments on the US stock market, we conclude that among the various factors, the liquidity factors consistently emerge as key drivers of return reversal, which is in support of the theory of liquidity effect. Specifically, we find that stocks with high turnover rates or high Amihud illiquidity measures have a greater probability of experiencing return reversals. Apart from the consistent drivers, we find other drivers of return reversal that generally change from year to year, and they serve as important characteristics for evaluating the trends of stock returns. Besides, we also identify some seldom discussed yet enlightening inter-factor relationships, one of which shows that stocks in Finance and Insurance industry are more likely to have high Amihud illiquidity measures in comparison with those in other industries. These conclusions are robust for return reversals under different thresholds. PMID:27893780

Identifying Key Drivers of Return Reversal with Dynamical Bayesian Factor Graph.

PubMed

Zhao, Shuai; Tong, Yunhai; Wang, Zitian; Tan, Shaohua

2016-01-01

In the stock market, return reversal occurs when investors sell overbought stocks and buy oversold stocks, reversing the stocks' price trends. In this paper, we develop a new method to identify key drivers of return reversal by incorporating a comprehensive set of factors derived from different economic theories into one unified dynamical Bayesian factor graph. We then use the model to depict factor relationships and their dynamics, from which we make some interesting discoveries about the mechanism behind return reversals. Through extensive experiments on the US stock market, we conclude that among the various factors, the liquidity factors consistently emerge as key drivers of return reversal, which is in support of the theory of liquidity effect. Specifically, we find that stocks with high turnover rates or high Amihud illiquidity measures have a greater probability of experiencing return reversals. Apart from the consistent drivers, we find other drivers of return reversal that generally change from year to year, and they serve as important characteristics for evaluating the trends of stock returns. Besides, we also identify some seldom discussed yet enlightening inter-factor relationships, one of which shows that stocks in Finance and Insurance industry are more likely to have high Amihud illiquidity measures in comparison with those in other industries. These conclusions are robust for return reversals under different thresholds.

Graphing with "LogoWriter."

ERIC Educational Resources Information Center

Yoder, Sharon K.

This book discusses four kinds of graphs that are taught in mathematics at the middle school level: pictographs, bar graphs, line graphs, and circle graphs. The chapters on each of these types of graphs contain information such as starting, scaling, drawing, labeling, and finishing the graphs using "LogoWriter." The final chapter of the…

The influence of regional hydrology on nesting behavior and nest fate of the American alligator

USGS Publications Warehouse

Ugarte, Cristina A.; Bass, Oron L.; Nuttle, William; Mazzotti, Frank J.; Rice, Kenneth G.; Fujisaki, Ikuko; Whelan, Kevin R.T.

2013-01-01

Hydrologic conditions are critical to the nesting behavior and reproductive success of crocodilians. In South Florida, USA, growing human settlement has led to extensive surface water management and modification of historical water flows in the wetlands, which have affected regional nesting of the American alligator (Alligator mississippiensis). Although both natural and anthropogenic factors are considered to determine hydrologic conditions, the aspects of hydrological patterns that affect alligator nest effort, flooding (partial and complete), and failure (no hatchling) are unclear. We deconstructed annual hydrological patterns using harmonic models that estimated hydrological matrices including mean, amplitude, timing of peak, and periodicity of surface water depth and discharge and examined their effects on alligator nesting using survey data from Shark Slough, Everglades National Park, from 1985 to 2005. Nest effort increased in years with higher mean and lesser periodicity of water depth. A greater proportion of nests were flooded and failed when peak discharge occurred earlier in the year. Also, nest flooding rates were greater in years with greater periodicity of water depth, and nest failure rate was greater when mean discharge was higher. This study guides future water management decisions to mitigate negative impacts on reproduction of alligators and provides wildlife managers with a tool for assessing and modifying annual water management plans to conserve crocodilians and other wetland species.

mpiGraph

DOE Office of Scientific and Technical Information (OSTI.GOV)

Moody, Adam

2007-05-22

MpiGraph consists of an MPI application called mpiGraph written in C to measure message bandwidth and an associated crunch_mpiGraph script written in Perl to process the application output into an HTMO report. The mpiGraph application is designed to inspect the health and scalability of a high-performance interconnect while under heavy load. This is useful to detect hardware and software problems in a system, such as slow nodes, links, switches, or contention in switch routing. It is also useful to characterize how interconnect performance changes with different settings or how one interconnect type compares to another.

Arctic foxes, lemmings, and canada goose nest survival at cape Churchill, Manitoba

USGS Publications Warehouse

Reiter, M.E.; Andersen, D.E.

2011-01-01

We examined factors influencing Canada Goose (Branta canadensis interior) annual nest success, including the relative abundance of collared lemmings (Dicrostonyx richardsoni), arctic fox (Alopex lagopus) den occupancy, nest density, and spring phenology using data collected during annual Canada Goose breeding area surveys at Cape Churchill, Manitoba. Nest density and arctic fox den occupancy strongly influenced Canada Goose nest success. High nest density resulted in higher nest success and high den occupancy reduced nest success. Nest success was not influenced by lemming abundance in the current or previous year as predicted by the "bird-lemming" hypothesis. Reducing arctic fox abundance through targeted management increased nest survival of Canada Geese; a result that further emphasizes the importance of arctic fox as nest predators in this system. The spatial distribution of nest predators, at least for dispersed-nesting geese, may be most important for nest survival, regardless of the abundance of small mammals in the local ecosystem. Further understanding of the factors influencing the magnitude and variance in arctic fox abundance in this region, and the spatial scale at which these factors are realized, is necessary to fully explain predator-prey-alternative prey dynamics in this system. ?? 2011 by the Wilson Ornithological Society.

Reaction factoring and bipartite update graphs accelerate the Gillespie Algorithm for large-scale biochemical systems.

PubMed

Indurkhya, Sagar; Beal, Jacob

2010-01-06

ODE simulations of chemical systems perform poorly when some of the species have extremely low concentrations. Stochastic simulation methods, which can handle this case, have been impractical for large systems due to computational complexity. We observe, however, that when modeling complex biological systems: (1) a small number of reactions tend to occur a disproportionately large percentage of the time, and (2) a small number of species tend to participate in a disproportionately large percentage of reactions. We exploit these properties in LOLCAT Method, a new implementation of the Gillespie Algorithm. First, factoring reaction propensities allows many propensities dependent on a single species to be updated in a single operation. Second, representing dependencies between reactions with a bipartite graph of reactions and species requires only storage for reactions, rather than the required for a graph that includes only reactions. Together, these improvements allow our implementation of LOLCAT Method to execute orders of magnitude faster than currently existing Gillespie Algorithm variants when simulating several yeast MAPK cascade models.

Presenting simulation results in a nested loop plot.

PubMed

Rücker, Gerta; Schwarzer, Guido

2014-12-12

Statisticians investigate new methods in simulations to evaluate their properties for future real data applications. Results are often presented in a number of figures, e.g., Trellis plots. We had conducted a simulation study on six statistical methods for estimating the treatment effect in binary outcome meta-analyses, where selection bias (e.g., publication bias) was suspected because of apparent funnel plot asymmetry. We varied five simulation parameters: true treatment effect, extent of selection, event proportion in control group, heterogeneity parameter, and number of studies in meta-analysis. In combination, this yielded a total number of 768 scenarios. To present all results using Trellis plots, 12 figures were needed. Choosing bias as criterion of interest, we present a 'nested loop plot', a diagram type that aims to have all simulation results in one plot. The idea was to bring all scenarios into a lexicographical order and arrange them consecutively on the horizontal axis of a plot, whereas the treatment effect estimate is presented on the vertical axis. The plot illustrates how parameters simultaneously influenced the estimate. It can be combined with a Trellis plot in a so-called hybrid plot. Nested loop plots may also be applied to other criteria such as the variance of estimation. The nested loop plot, similar to a time series graph, summarizes all information about the results of a simulation study with respect to a chosen criterion in one picture and provides a suitable alternative or an addition to Trellis plots.

Catastrophic health expenditure: a comparative analysis of empty-nest and non-empty-nest households with seniors in Shandong, China.

PubMed

Yang, Tingting; Chu, Jie; Zhou, Chengchao; Medina, Alexis; Li, Cuicui; Jiang, Shan; Zheng, Wengui; Sun, Liyuan; Liu, Jing

2016-07-05

The aim of this study was to compare the catastrophic health expenditure (CHE) prevalence and its determinants between empty-nest and non-empty-nest elderly households. Shandong province of China. A total of 2761 elderly households are included in the analysis. CHE incidence among elderly households was 44.9%. The CHE incidence of empty-nest singles (59.3%, p=0.000, OR=3.19) and empty-nest couples (52.9%, p=0.000, OR=2.45) are both statistically higher than that of non-empty-nest elderly households (31.4%). An inverse association was observed between CHE incidence and income level in all elderly household types. Factors including 1 or more household elderly members with non-communicable chronic diseases in the past 6 months, 1 or more elderly household members being hospitalised in the past year and lower household income, are significant risk factors for CHE in all 3 household types (p<0.05). Health insurance status was found to be a significant determinant of CHE among empty-nest singles and non-empty-nest households (p<0.05). CHE incidence among elderly households is high in China. Empty-nest households are at higher risk for CHE than non-empty-nest households. Based on these findings, we suggest that special insurance be developed to broaden the coverage of health services and heighten the reimbursement rate for empty-nest elderly in the existing health insurance schemes. Financial and social protection interventions are also essential for identified at-risk subgroups among different types of elderly households. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/

Eggs, nests, and nesting behavior of akiapolaau (Drepanidinae)

USGS Publications Warehouse

Banko, P.C.; Williams, J.

1993-01-01

We describe the fifth verified nest and first verified egg of the Akiapolaau (Hemignathus munroi), an endangered Hawaiian honeycreeper. We dispute the validity of Bryan?s (1905a) description of three eggs and two nests of the Akiapolaau. Eggs that he attributed to this species were much smaller than ours, and his nest descriptions did not match the only nest apparently belonging to the Akiapolaau in the B. P. Bishop Museum in Honolulu, where Bryan worked. Twigs and bark were distinctively combined in the nest that we examined. We compare eggs and nests of the Akiapolaau with those of other Hawaiian honeycreepers.

A graph model for preventing railway accidents based on the maximal information coefficient

NASA Astrophysics Data System (ADS)

Shao, Fubo; Li, Keping

2017-01-01

A number of factors influences railway safety. It is an important work to identify important influencing factors and to build the relationship between railway accident and its influencing factors. The maximal information coefficient (MIC) is a good measure of dependence for two-variable relationships which can capture a wide range of associations. Employing MIC, a graph model is proposed for preventing railway accidents which avoids complex mathematical computation. In the graph, nodes denote influencing factors of railway accidents and edges represent dependence of the two linked factors. With the increasing of dependence level, the graph changes from a globally coupled graph to isolated points. Moreover, the important influencing factors are identified from many factors which are the monitor key. Then the relationship between railway accident and important influencing factors is obtained by employing the artificial neural networks. With the relationship, a warning mechanism is built by giving the dangerous zone. If the related factors fall into the dangerous zone in railway operations, the warning level should be raised. The built warning mechanism can prevent railway accidents and can promote railway safety.

X-Graphs: Language and Algorithms for Heterogeneous Graph Streams

DTIC Science & Technology

2017-09-01

INTRODUCTION 1 3 METHODS , ASUMPTIONS, AND PROCEDURES 2 Software Abstractions for Graph Analytic Applications 2 High performance Platforms for Graph Processing...data is stored in a distributed file system. 3 METHODS , ASUMPTIONS, AND PROCEDURES Software Abstractions for Graph Analytic Applications To...implementations of novel methods for networks analysis: several methods for detection of overlapping communities, personalized PageRank, node embeddings into a d

Quantization of gauge fields, graph polynomials and graph homology

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kreimer, Dirk, E-mail: kreimer@physik.hu-berlin.de; Sars, Matthias; Suijlekom, Walter D. van

2013-09-15

We review quantization of gauge fields using algebraic properties of 3-regular graphs. We derive the Feynman integrand at n loops for a non-abelian gauge theory quantized in a covariant gauge from scalar integrands for connected 3-regular graphs, obtained from the two Symanzik polynomials. The transition to the full gauge theory amplitude is obtained by the use of a third, new, graph polynomial, the corolla polynomial. This implies effectively a covariant quantization without ghosts, where all the relevant signs of the ghost sector are incorporated in a double complex furnished by the corolla polynomial–we call it cycle homology–and by graph homology.more » -- Highlights: •We derive gauge theory Feynman from scalar field theory with 3-valent vertices. •We clarify the role of graph homology and cycle homology. •We use parametric renormalization and the new corolla polynomial.« less

Graphing trillions of triangles

PubMed Central

Burkhardt, Paul

2016-01-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed. PMID:28690426

Graphing trillions of triangles.

PubMed

Burkhardt, Paul

2017-07-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.

PyNEST: A Convenient Interface to the NEST Simulator.

PubMed

Eppler, Jochen Martin; Helias, Moritz; Muller, Eilif; Diesmann, Markus; Gewaltig, Marc-Oliver

2008-01-01

The neural simulation tool NEST (http://www.nest-initiative.org) is a simulator for heterogeneous networks of point neurons or neurons with a small number of compartments. It aims at simulations of large neural systems with more than 10(4) neurons and 10(7) to 10(9) synapses. NEST is implemented in C++ and can be used on a large range of architectures from single-core laptops over multi-core desktop computers to super-computers with thousands of processor cores. Python (http://www.python.org) is a modern programming language that has recently received considerable attention in Computational Neuroscience. Python is easy to learn and has many extension modules for scientific computing (e.g. http://www.scipy.org). In this contribution we describe PyNEST, the new user interface to NEST. PyNEST combines NEST's efficient simulation kernel with the simplicity and flexibility of Python. Compared to NEST's native simulation language SLI, PyNEST makes it easier to set up simulations, generate stimuli, and analyze simulation results. We describe how PyNEST connects NEST and Python and how it is implemented. With a number of examples, we illustrate how it is used.

PyNEST: A Convenient Interface to the NEST Simulator

PubMed Central

Eppler, Jochen Martin; Helias, Moritz; Muller, Eilif; Diesmann, Markus; Gewaltig, Marc-Oliver

2008-01-01

The neural simulation tool NEST (http://www.nest-initiative.org) is a simulator for heterogeneous networks of point neurons or neurons with a small number of compartments. It aims at simulations of large neural systems with more than 104 neurons and 107 to 109 synapses. NEST is implemented in C++ and can be used on a large range of architectures from single-core laptops over multi-core desktop computers to super-computers with thousands of processor cores. Python (http://www.python.org) is a modern programming language that has recently received considerable attention in Computational Neuroscience. Python is easy to learn and has many extension modules for scientific computing (e.g. http://www.scipy.org). In this contribution we describe PyNEST, the new user interface to NEST. PyNEST combines NEST's efficient simulation kernel with the simplicity and flexibility of Python. Compared to NEST's native simulation language SLI, PyNEST makes it easier to set up simulations, generate stimuli, and analyze simulation results. We describe how PyNEST connects NEST and Python and how it is implemented. With a number of examples, we illustrate how it is used. PMID:19198667

Using survival analysis of artificial and Real Brewer's sparrow (Spizella breweri breweri) nests to model site level and nest site factors associated with nest success in the South Okanagan region of Canada

Treesearch

Pam Krannitz Kym Welstead

2005-01-01

Predation is the predominant cause of nest failure for the Brewer's Sparrow (Spizella breweri breweri), a provincially red-listed shrub-steppe species that has experienced significant declines throughout most of its range. We monitored Brewer’s Sparrow nests and conducted an artificial nest experiment, in the South Okanagan Valley,...

Learning graph matching.

PubMed

Caetano, Tibério S; McAuley, Julian J; Cheng, Li; Le, Quoc V; Smola, Alex J

2009-06-01

As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalisation, a state-of-the-art quadratic assignment relaxation algorithm.

EvoGraph: On-The-Fly Efficient Mining of Evolving Graphs on GPU

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sengupta, Dipanjan; Song, Shuaiwen

With the prevalence of the World Wide Web and social networks, there has been a growing interest in high performance analytics for constantly-evolving dynamic graphs. Modern GPUs provide massive AQ1 amount of parallelism for efficient graph processing, but the challenges remain due to their lack of support for the near real-time streaming nature of dynamic graphs. Specifically, due to the current high volume and velocity of graph data combined with the complexity of user queries, traditional processing methods by first storing the updates and then repeatedly running static graph analytics on a sequence of versions or snapshots are deemed undesirablemore » and computational infeasible on GPU. We present EvoGraph, a highly efficient and scalable GPU- based dynamic graph analytics framework.« less

Reflecting on Graphs: Attributes of Graph Choice and Construction Practices in Biology

PubMed Central

Angra, Aakanksha; Gardner, Stephanie M.

2017-01-01

Undergraduate biology education reform aims to engage students in scientific practices such as experimental design, experimentation, and data analysis and communication. Graphs are ubiquitous in the biological sciences, and creating effective graphical representations involves quantitative and disciplinary concepts and skills. Past studies document student difficulties with graphing within the contexts of classroom or national assessments without evaluating student reasoning. Operating under the metarepresentational competence framework, we conducted think-aloud interviews to reveal differences in reasoning and graph quality between undergraduate biology students, graduate students, and professors in a pen-and-paper graphing task. All professors planned and thought about data before graph construction. When reflecting on their graphs, professors and graduate students focused on the function of graphs and experimental design, while most undergraduate students relied on intuition and data provided in the task. Most undergraduate students meticulously plotted all data with scaled axes, while professors and some graduate students transformed the data, aligned the graph with the research question, and reflected on statistics and sample size. Differences in reasoning and approaches taken in graph choice and construction corroborate and extend previous findings and provide rich targets for undergraduate and graduate instruction. PMID:28821538

Influences of Species Interactions With Aggressive Ants and Habitat Filtering on Nest Colonization and Community Composition of Arboreal Twig-Nesting Ants.

PubMed

Philpott, Stacy M; Serber, Zachary; De la Mora, Aldo

2018-04-05

Ant community assembly is driven by many factors including species interactions (e.g., competition, predation, parasitism), habitat filtering (e.g., vegetation differences, microclimate, food and nesting resources), and dispersal. Canopy ant communities, including dominant and twig-nesting ants, are structured by all these different factors, but we know less about the impacts of species interactions and habitat filters acting at the colonization or recruitment stage. We examined occupation of artificial twig nests placed in shade trees in coffee agroecosystems. We asked whether species interactions-aggression from the dominant canopy ant, Azteca sericeasur Longino (Hymenoptera: Formicidae)-or habitat filtering-species of tree where nests were placed or surrounding vegetation-influence colonization, species richness, and community composition of twig-nesting ants. We found 20 species of ants occupying artificial nests. Nest occupation was lower on trees with A. sericeasur, but did not differ depending on tree species or surrounding vegetation. Yet, there were species-specific differences in occupation depending on A. sericeasur presence and tree species. Ant species richness did not vary with A. sericeasur presence or tree species. Community composition varied with A. sericeasur presence and surrounding vegetation. Our results suggest that species interactions with dominant ants are important determinants of colonization and community composition of twig-nesting ants. Habitat filtering at the level of tree species did not have strong effects on twig-nesting ants, but changes in coffee management may contribute to differences in community composition with important implications for ant conservation in agricultural landscapes, as well as biological control of coffee pests.

Multiscale weighted colored graphs for protein flexibility and rigidity analysis

NASA Astrophysics Data System (ADS)

Bramer, David; Wei, Guo-Wei

2018-02-01

Protein structural fluctuation, measured by Debye-Waller factors or B-factors, is known to correlate to protein flexibility and function. A variety of methods has been developed for protein Debye-Waller factor prediction and related applications to domain separation, docking pose ranking, entropy calculation, hinge detection, stability analysis, etc. Nevertheless, none of the current methodologies are able to deliver an accuracy of 0.7 in terms of the Pearson correlation coefficients averaged over a large set of proteins. In this work, we introduce a paradigm-shifting geometric graph model, multiscale weighted colored graph (MWCG), to provide a new generation of computational algorithms to significantly change the current status of protein structural fluctuation analysis. Our MWCG model divides a protein graph into multiple subgraphs based on interaction types between graph nodes and represents the protein rigidity by generalized centralities of subgraphs. MWCGs not only predict the B-factors of protein residues but also accurately analyze the flexibility of all atoms in a protein. The MWCG model is validated over a number of protein test sets and compared with many standard methods. An extensive numerical study indicates that the proposed MWCG offers an accuracy of over 0.8 and thus provides perhaps the first reliable method for estimating protein flexibility and B-factors. It also simultaneously predicts all-atom flexibility in a molecule.

Fibroblast growth factor-10 signals development of von Brunn's nests in the exstrophic bladder

PubMed Central

Eastman, Rocky; Leaf, Elizabeth M.; Zhang, Dianzhong; True, Lawrence D.; Sweet, Robert M.; Seidel, Kristy; Siebert, Joseph R.; Grady, Richard; Mitchell, Michael E.

2010-01-01

von Brunn's nests have long been recognized as precursors of benign lesions of the urinary bladder mucosa. We report here that von Brunn's nests are especially prevalent in the exstrophic bladder, a birth defect that predisposes the patient to formation of bladder cancer. Cells of von Brunn's nest were found to coalesce into a stratified, polarized epithelium which surrounds itself with a capsule-like structure rich in types I, III, and IV collagen. Histocytochemical analysis and keratin profiling demonstrated that nested cells exhibited a phenotype similar, but not identical, to that of urothelial cells of transitional epithelium. Immunostaining and in situ hybridization analysis of exstrophic tissue demonstrated that the FGF-10 receptor is synthesized and retained by cells of von Brunn's nest. In contrast, FGF-10 is synthesized and secreted by mesenchymal fibroblasts via a paracrine pathway that targets basal epithelial cells of von Brunn's nests. Small clusters of 10pRp cells, positive for both FGF-10 and its receptor, were observed both proximal to and inside blood vessels in the lamina propria. The collective evidence points to a mechanism where von Brunn's nests develop under the control of the FGF-10 signal transduction system and suggests that 10pRp cells may be the original source of nested cells. PMID:20719973

Dynamics of habitat selection in birds: adaptive response to nest predation depends on multiple factors.

PubMed

Devries, J H; Clark, R G; Armstrong, L M

2018-05-01

According to theory, habitat selection by organisms should reflect underlying habitat-specific fitness consequences and, in birds, reproductive success has a strong impact on population growth in many species. Understanding processes affecting habitat selection also is critically important for guiding conservation initiatives. Northern pintails (Anas acuta) are migratory, temperate-nesting birds that breed in greatest concentrations in the prairies of North America and their population remains below conservation goals. Habitat loss and changing land use practices may have decoupled formerly reliable fitness cues with respect to nest habitat choices. We used data from 62 waterfowl nesting study sites across prairie Canada (1997-2009) to examine nest survival, a primary fitness metric, at multiple scales, in combination with estimates of habitat selection (i.e., nests versus random points), to test for evidence of adaptive habitat choices. We used the same habitat covariates in both analyses. Pintail nest survival varied with nest initiation date, nest habitat, pintail breeding pair density, landscape composition and annual moisture. Selection of nesting habitat reflected patterns in nest survival in some cases, indicating adaptive selection, but strength of habitat selection varied seasonally and depended on population density and landscape composition. Adaptive selection was most evident late in the breeding season, at low breeding densities and in cropland-dominated landscapes. Strikingly, at high breeding density, habitat choice appears to become maladaptive relative to nest predation. At larger spatial scales, the relative availability of habitats with low versus high nest survival, and changing land use practices, may limit the reproductive potential of pintails.

Counting the number of Feynman graphs in QCD

NASA Astrophysics Data System (ADS)

Kaneko, T.

2018-05-01

Information about the number of Feynman graphs for a given physical process in a given field theory is especially useful for confirming the result of a Feynman graph generator used in an automatic system of perturbative calculations. A method of counting the number of Feynman graphs with weight of symmetry factor was established based on zero-dimensional field theory, and was used in scalar theories and QED. In this article this method is generalized to more complicated models by direct calculation of generating functions on a computer algebra system. This method is applied to QCD with and without counter terms, where many higher order are being calculated automatically.

Reaction Factoring and Bipartite Update Graphs Accelerate the Gillespie Algorithm for Large-Scale Biochemical Systems

PubMed Central

Indurkhya, Sagar; Beal, Jacob

2010-01-01

ODE simulations of chemical systems perform poorly when some of the species have extremely low concentrations. Stochastic simulation methods, which can handle this case, have been impractical for large systems due to computational complexity. We observe, however, that when modeling complex biological systems: (1) a small number of reactions tend to occur a disproportionately large percentage of the time, and (2) a small number of species tend to participate in a disproportionately large percentage of reactions. We exploit these properties in LOLCAT Method, a new implementation of the Gillespie Algorithm. First, factoring reaction propensities allows many propensities dependent on a single species to be updated in a single operation. Second, representing dependencies between reactions with a bipartite graph of reactions and species requires only storage for reactions, rather than the required for a graph that includes only reactions. Together, these improvements allow our implementation of LOLCAT Method to execute orders of magnitude faster than currently existing Gillespie Algorithm variants when simulating several yeast MAPK cascade models. PMID:20066048

GraphMeta: Managing HPC Rich Metadata in Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dai, Dong; Chen, Yong; Carns, Philip

High-performance computing (HPC) systems face increasingly critical metadata management challenges, especially in the approaching exascale era. These challenges arise not only from exploding metadata volumes, but also from increasingly diverse metadata, which contains data provenance and arbitrary user-defined attributes in addition to traditional POSIX metadata. This ‘rich’ metadata is becoming critical to supporting advanced data management functionality such as data auditing and validation. In our prior work, we identified a graph-based model as a promising solution to uniformly manage HPC rich metadata due to its flexibility and generality. However, at the same time, graph-based HPC rich metadata anagement also introducesmore » significant challenges to the underlying infrastructure. In this study, we first identify the challenges on the underlying infrastructure to support scalable, high-performance rich metadata management. Based on that, we introduce GraphMeta, a graphbased engine designed for this use case. It achieves performance scalability by introducing a new graph partitioning algorithm and a write-optimal storage engine. We evaluate GraphMeta under both synthetic and real HPC metadata workloads, compare it with other approaches, and demonstrate its advantages in terms of efficiency and usability for rich metadata management in HPC systems.« less

A topo-graph model for indistinct target boundary definition from anatomical images.

PubMed

Cui, Hui; Wang, Xiuying; Zhou, Jianlong; Gong, Guanzhong; Eberl, Stefan; Yin, Yong; Wang, Lisheng; Feng, Dagan; Fulham, Michael

2018-06-01

It can be challenging to delineate the target object in anatomical imaging when the object boundaries are difficult to discern due to the low contrast or overlapping intensity distributions from adjacent tissues. We propose a topo-graph model to address this issue. The first step is to extract a topographic representation that reflects multiple levels of topographic information in an input image. We then define two types of node connections - nesting branches (NBs) and geodesic edges (GEs). NBs connect nodes corresponding to initial topographic regions and GEs link the nodes at a detailed level. The weights for NBs are defined to measure the similarity of regional appearance, and weights for GEs are defined with geodesic and local constraints. NBs contribute to the separation of topographic regions and the GEs assist the delineation of uncertain boundaries. Final segmentation is achieved by calculating the relevance of the unlabeled nodes to the labels by the optimization of a graph-based energy function. We test our model on 47 low contrast CT studies of patients with non-small cell lung cancer (NSCLC), 10 contrast-enhanced CT liver cases and 50 breast and abdominal ultrasound images. The validation criteria are the Dice's similarity coefficient and the Hausdorff distance. Student's t-test show that our model outperformed the graph models with pixel-only, pixel and regional, neighboring and radial connections (p-values <0.05). Our findings show that the topographic representation and topo-graph model provides improved delineation and separation of objects from adjacent tissues compared to the tested models. Copyright © 2018 Elsevier B.V. All rights reserved.

Nesting ecology of Whimbrels in boreal Alaska

USGS Publications Warehouse

Harwood, Christopher M.; Gill, Robert E.; Powell, Abby

2016-01-01

Breeding ecology studies of boreal waders have been relatively scarce in North America. This paucity is due in part to boreal habitats being difficult to access, and boreal waders being widely dispersed and thus difficult to monitor. Between 2008 and 2014 we studied the nesting ecology of Whimbrels Numenius phaeopus hudsonicus in interior Alaska, a region characterized by an active wildfire regime. Our objectives were to (1) describe the nesting ecology of Whimbrels in tundra patches within the boreal forest, (2) assess the influence of habitat features at multiple scales on nest-site selection, and (3) characterize factors affecting nest survival. Whimbrels nested in the largest patches and exhibited a consistently compressed annual breeding schedule. We hypothesized that these Whimbrels would exhibit synchronous and clustered nesting, but observed synchronous nesting in only 2009 and 2011, and evidence of clustered nesting at just one study area in 2009, providing limited support for the hypothesis. Nests tended to be on hummocks and exhibited lateral concealment around the bowl, suggesting a trade-off between a greater view from the nest and concealment. However, our analysis failed to identify other important habitat features at scales from 1–400 m from the nest. Our best-supported nest survival model showed a strong difference between our two main study areas, but this difference remains largely unexplained. Given the increased frequency, severity, and extent of wildfires predicted under climate change scenarios, our study highlights the importance of monitoring the persistence of boreal tundra patches and the Whimbrels breeding therein.

On the strong metric dimension of generalized butterfly graph, starbarbell graph, and {C}_{m}\\odot {P}_{n} graph

NASA Astrophysics Data System (ADS)

Yunia Mayasari, Ratih; Atmojo Kusmayadi, Tri

2018-04-01

Let G be a connected graph with vertex set V(G) and edge set E(G). For every pair of vertices u,v\\in V(G), the interval I[u, v] between u and v to be the collection of all vertices that belong to some shortest u ‑ v path. A vertex s\\in V(G) strongly resolves two vertices u and v if u belongs to a shortest v ‑ s path or v belongs to a shortest u ‑ s path. A vertex set S of G is a strong resolving set of G if every two distinct vertices of G are strongly resolved by some vertex of S. The strong metric basis of G is a strong resolving set with minimal cardinality. The strong metric dimension sdim(G) of a graph G is defined as the cardinality of strong metric basis. In this paper we determine the strong metric dimension of a generalized butterfly graph, starbarbell graph, and {C}mȯ {P}n graph. We obtain the strong metric dimension of generalized butterfly graph is sdim(BFn ) = 2n ‑ 2. The strong metric dimension of starbarbell graph is sdim(S{B}{m1,{m}2,\\ldots,{m}n})={\\sum }i=1n({m}i-1)-1. The strong metric dimension of {C}mȯ {P}n graph are sdim({C}mȯ {P}n)=2m-1 for m > 3 and n = 2, and sdim({C}mȯ {P}n)=2m-2 for m > 3 and n > 2.

Complexity of chemical graphs in terms of size, branching, and cyclicity.

PubMed

Balaban, A T; Mills, D; Kodali, V; Basak, S C

2006-08-01

Chemical graph complexity depends on many factors, but the main ones are size, branching, and cyclicity. Some molecular descriptors embrace together all these three parameters, which cannot then be disentangled. The topological index J (and its refinements that include accounting for bond multiplicity and the presence of heteroatoms) was designed to compensate in a significant measure for graph size and cyclicity, and therefore it contains information mainly on branching. In order to separate these factors, two new indices (F and G) related with J are proposed, which allow to group together graphs with the same size into families of constitutional formulas differing in their branching and cyclicity. A comparison with other topological indices revealed that a few other topological indices vary similarly with index G, notably DN2S4 among the triplet indices, and TOTOP among the indices contained in the Molconn-Z program. This comparison involved all possible chemical graphs (i.e. connected planar graphs with vertex degrees not higher than four) with four through six vertices, and all possible alkanes with four through nine carbon atoms.

Graphing Important People

ERIC Educational Resources Information Center

Reading Teacher, 2012

2012-01-01

The "Toolbox" column features content adapted from ReadWriteThink.org lesson plans and provides practical tools for classroom teachers. This issue's column features a lesson plan adapted from "Graphing Plot and Character in a Novel" by Lisa Storm Fink and "Bio-graph: Graphing Life Events" by Susan Spangler. Students retell biographic events…

Supermanifolds from Feynman graphs

NASA Astrophysics Data System (ADS)

Marcolli, Matilde; Rej, Abhijnan

2008-08-01

We generalize the computation of Feynman integrals of log divergent graphs in terms of the Kirchhoff polynomial to the case of graphs with both fermionic and bosonic edges, to which we assign a set of ordinary and Grassmann variables. This procedure gives a computation of the Feynman integrals in terms of a period on a supermanifold, for graphs admitting a basis of the first homology satisfying a condition generalizing the log divergence in this context. The analog in this setting of the graph hypersurfaces is a graph supermanifold given by the divisor of zeros and poles of the Berezinian of a matrix associated with the graph, inside a superprojective space. We introduce a Grothendieck group for supermanifolds and identify the subgroup generated by the graph supermanifolds. This can be seen as a general procedure for constructing interesting classes of supermanifolds with associated periods.

Daily survival rate for nests and chicks of Least Terns (Sternula antillarum) at natural nest sites in South Carolina

USGS Publications Warehouse

Brooks, Gillian L.; Sanders, Felicia J.; Gerard, Patrick D.; Jodice, Patrick G.R.

2013-01-01

Although a species of conservation concern, little is known about the reproductive success of Least Terns (Sternula antillarum) throughout the southeastern USA where availability of natural beaches for nesting is limited. Daily survival rate (DSR) of nests and chicks was examined at four natural nesting sites in Cape Romain National Wildlife Refuge, South Carolina, 2009–2010. Measures of nest success (n = 257 nests) ranged from 0–93% among colony sites. The DSR of nests was primarily related to colony site, but year and estimates of predation risk also were related to DSR. Predation was the principal cause of identifiable nest loss, accounting for 47% of nest failures when the two years of data were pooled. The probability (± SE) of a chick surviving from hatching to fledging = 0.449 ± 0.01 (n = 92 chicks). DSR of chicks was negatively related to tide height and rainfall. Therefore, productivity of Least Terns is being lost during both the nesting and chick stage through a combination of biotic and abiotic factors that may prove difficult to fully mitigate or manage. Although natural nesting sites within Cape Romain National Wildlife Refuge intermittently produce successful nests, the consistency of productivity over the long term is still unknown. Given that the long term availability of anthropogenic nest sites (e.g., rooftops, dredge-spoil islands) for Least Terns is questionable, further research is required both locally and throughout the region to assess the extent to which natural sites act as population sources or sinks.

Variability in nest survival rates and implications to nesting studies

USGS Publications Warehouse

Klett, A.T.; Johnson, D.H.

1982-01-01

We used four reasonably large samples (83-213) of Mallard (Anas platyrhynchos) and Blue-winged Teal (A. discors) nests on an interstate highway right-of-way in southcentral North Dakota to evaluate potential biases in hatch-rate estimates. Twelve consecutive, weekly searches for nests were conducted with a cable-chain drag in 1976 and 1977. Nests were revisited at weekly intervals. Four methods were used to estimate hatch rates for the four data sets: the Traditional Method, the Mayfield Method, and two modifications of the Mayfield Method that are sometimes appropriate when daily mortality rates of nests are not constant. Hatch rates and the average age of nests at discovery declined as the interval between searches decreased, suggesting that mortality rates were not constant in our samples. An analysis of variance indicated that daily mortality rates varied with the age of nests in all four samples. Mortality was generally highest during the early laying period, moderately high during the late laying period, and lowest during incubation. We speculate that this relationship of mortality to nest age might be due to the presence of hens at nests or to differences in the vulnerability of nest sites to predation. A modification of the Mayfield Method that accounts for age-related variation in nest mortality was most appropriate for our samples. We suggest methods for conducting nesting studies and estimating nest success for species possessing similar nesting habits.

Nest site selection by Kentish plover suggests a trade-off between nest-crypsis and predator detection strategies.

PubMed

Gómez-Serrano, Miguel Ángel; López-López, Pascual

2014-01-01

Predation is one of the main causes of adult mortality and breeding failure for ground-nesting birds. Micro-habitat structure around nests plays a critical role in minimizing predation risk. Plovers nest in sites with little vegetation cover to maximize the incubating adult visibility, but many studies suggest a trade-off between nest-crypsis and predator detection strategies. However, this trade-off has not been explored in detail because methods used so far do not allow estimating the visibility with regards to critical factors such as slope or plant permeability to vision. Here, we tested the hypothesis that Kentish plovers select exposed sites according to a predator detection strategy, and the hypothesis that more concealed nests survive longer according to a crypsis strategy. To this end, we obtained an accurate estimation of the incubating adult's field of vision through a custom built inverted periscope. Our results showed that plovers selected nest sites with higher visibility than control points randomly selected with regards to humans and dogs, although nests located in sites with higher vegetation cover survived longer. In addition, the flushing distance (i.e., the distance at which incubating adults leave the nest when they detect a potential predator) decreased with vegetation cover. Consequently, the advantages of concealing the nest were limited by the ability to detect predators, thus indirectly supporting the existence of the trade-off between crypsis and predator detection. Finally, human disturbance also constrained nest choice, forcing plovers to move to inland sites that were less suitable because of higher vegetation cover, and modulated flushing behavior, since plovers that were habituated to humans left their nests closer to potential predators. This constraint on the width of suitable breeding habitat is particularly relevant for the conservation of Kentish Plover in sand beaches, especially under the current context of coastal regression

Nest Site Selection by Kentish Plover Suggests a Trade-Off between Nest-Crypsis and Predator Detection Strategies

PubMed Central

Gómez-Serrano, Miguel Ángel; López-López, Pascual

2014-01-01

Predation is one of the main causes of adult mortality and breeding failure for ground-nesting birds. Micro-habitat structure around nests plays a critical role in minimizing predation risk. Plovers nest in sites with little vegetation cover to maximize the incubating adult visibility, but many studies suggest a trade-off between nest-crypsis and predator detection strategies. However, this trade-off has not been explored in detail because methods used so far do not allow estimating the visibility with regards to critical factors such as slope or plant permeability to vision. Here, we tested the hypothesis that Kentish plovers select exposed sites according to a predator detection strategy, and the hypothesis that more concealed nests survive longer according to a crypsis strategy. To this end, we obtained an accurate estimation of the incubating adult's field of vision through a custom built inverted periscope. Our results showed that plovers selected nest sites with higher visibility than control points randomly selected with regards to humans and dogs, although nests located in sites with higher vegetation cover survived longer. In addition, the flushing distance (i.e., the distance at which incubating adults leave the nest when they detect a potential predator) decreased with vegetation cover. Consequently, the advantages of concealing the nest were limited by the ability to detect predators, thus indirectly supporting the existence of the trade-off between crypsis and predator detection. Finally, human disturbance also constrained nest choice, forcing plovers to move to inland sites that were less suitable because of higher vegetation cover, and modulated flushing behavior, since plovers that were habituated to humans left their nests closer to potential predators. This constraint on the width of suitable breeding habitat is particularly relevant for the conservation of Kentish Plover in sand beaches, especially under the current context of coastal regression

Topic Model for Graph Mining.

PubMed

Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng

2015-12-01

Graph mining has been a popular research area because of its numerous application scenarios. Many unstructured and structured data can be represented as graphs, such as, documents, chemical molecular structures, and images. However, an issue in relation to current research on graphs is that they cannot adequately discover the topics hidden in graph-structured data which can be beneficial for both the unsupervised learning and supervised learning of the graphs. Although topic models have proved to be very successful in discovering latent topics, the standard topic models cannot be directly applied to graph-structured data due to the "bag-of-word" assumption. In this paper, an innovative graph topic model (GTM) is proposed to address this issue, which uses Bernoulli distributions to model the edges between nodes in a graph. It can, therefore, make the edges in a graph contribute to latent topic discovery and further improve the accuracy of the supervised and unsupervised learning of graphs. The experimental results on two different types of graph datasets show that the proposed GTM outperforms the latent Dirichlet allocation on classification by using the unveiled topics of these two models to represent graphs.

Evolutionary dynamics on graphs

NASA Astrophysics Data System (ADS)

Lieberman, Erez; Hauert, Christoph; Nowak, Martin A.

2005-01-01

Evolutionary dynamics have been traditionally studied in the context of homogeneous or spatially extended populations. Here we generalize population structure by arranging individuals on a graph. Each vertex represents an individual. The weighted edges denote reproductive rates which govern how often individuals place offspring into adjacent vertices. The homogeneous population, described by the Moran process, is the special case of a fully connected graph with evenly weighted edges. Spatial structures are described by graphs where vertices are connected with their nearest neighbours. We also explore evolution on random and scale-free networks. We determine the fixation probability of mutants, and characterize those graphs for which fixation behaviour is identical to that of a homogeneous population. Furthermore, some graphs act as suppressors and others as amplifiers of selection. It is even possible to find graphs that guarantee the fixation of any advantageous mutant. We also study frequency-dependent selection and show that the outcome of evolutionary games can depend entirely on the structure of the underlying graph. Evolutionary graph theory has many fascinating applications ranging from ecology to multi-cellular organization and economics.

A graph edit dictionary for correcting errors in roof topology graphs reconstructed from point clouds

NASA Astrophysics Data System (ADS)

Xiong, B.; Oude Elberink, S.; Vosselman, G.

2014-07-01

In the task of 3D building model reconstruction from point clouds we face the problem of recovering a roof topology graph in the presence of noise, small roof faces and low point densities. Errors in roof topology graphs will seriously affect the final modelling results. The aim of this research is to automatically correct these errors. We define the graph correction as a graph-to-graph problem, similar to the spelling correction problem (also called the string-to-string problem). The graph correction is more complex than string correction, as the graphs are 2D while strings are only 1D. We design a strategy based on a dictionary of graph edit operations to automatically identify and correct the errors in the input graph. For each type of error the graph edit dictionary stores a representative erroneous subgraph as well as the corrected version. As an erroneous roof topology graph may contain several errors, a heuristic search is applied to find the optimum sequence of graph edits to correct the errors one by one. The graph edit dictionary can be expanded to include entries needed to cope with errors that were previously not encountered. Experiments show that the dictionary with only fifteen entries already properly corrects one quarter of erroneous graphs in about 4500 buildings, and even half of the erroneous graphs in one test area, achieving as high as a 95% acceptance rate of the reconstructed models.

Coordinates and intervals in graph-based reference genomes.

PubMed

Rand, Knut D; Grytten, Ivar; Nederbragt, Alexander J; Storvik, Geir O; Glad, Ingrid K; Sandve, Geir K

2017-05-18

It has been proposed that future reference genomes should be graph structures in order to better represent the sequence diversity present in a species. However, there is currently no standard method to represent genomic intervals, such as the positions of genes or transcription factor binding sites, on graph-based reference genomes. We formalize offset-based coordinate systems on graph-based reference genomes and introduce methods for representing intervals on these reference structures. We show the advantage of our methods by representing genes on a graph-based representation of the newest assembly of the human genome (GRCh38) and its alternative loci for regions that are highly variable. More complex reference genomes, containing alternative loci, require methods to represent genomic data on these structures. Our proposed notation for genomic intervals makes it possible to fully utilize the alternative loci of the GRCh38 assembly and potential future graph-based reference genomes. We have made a Python package for representing such intervals on offset-based coordinate systems, available at https://github.com/uio-cels/offsetbasedgraph . An interactive web-tool using this Python package to visualize genes on a graph created from GRCh38 is available at https://github.com/uio-cels/genomicgraphcoords .

Methods of visualizing graphs

DOEpatents

Wong, Pak C.; Mackey, Patrick S.; Perrine, Kenneth A.; Foote, Harlan P.; Thomas, James J.

2008-12-23

Methods for visualizing a graph by automatically drawing elements of the graph as labels are disclosed. In one embodiment, the method comprises receiving node information and edge information from an input device and/or communication interface, constructing a graph layout based at least in part on that information, wherein the edges are automatically drawn as labels, and displaying the graph on a display device according to the graph layout. In some embodiments, the nodes are automatically drawn as labels instead of, or in addition to, the label-edges.

Nest Predation Deviates from Nest Predator Abundance in an Ecologically Trapped Bird.

PubMed

Hollander, Franck A; Van Dyck, Hans; San Martin, Gilles; Titeux, Nicolas

2015-01-01

In human-modified environments, ecological traps may result from a preference for low-quality habitat where survival or reproductive success is lower than in high-quality habitat. It has often been shown that low reproductive success for birds in preferred habitat types was due to higher nest predator abundance. However, between-habitat differences in nest predation may only weakly correlate with differences in nest predator abundance. An ecological trap is at work in a farmland bird (Lanius collurio) that recently expanded its breeding habitat into open areas in plantation forests. This passerine bird shows a strong preference for forest habitat, but it has a higher nest success in farmland. We tested whether higher abundance of nest predators in the preferred habitat or, alternatively, a decoupling of nest predator abundance and nest predation explained this observed pattern of maladaptive habitat selection. More than 90% of brood failures were attributed to nest predation. Nest predator abundance was more than 50% higher in farmland, but nest predation was 17% higher in forest. Differences between nest predation on actual shrike nests and on artificial nests suggested that parent shrikes may facilitate nest disclosure for predators in forest more than they do in farmland. The level of caution by parent shrikes when visiting their nest during a simulated nest predator intrusion was the same in the two habitats, but nest concealment was considerably lower in forest, which contributes to explaining the higher nest predation in this habitat. We conclude that a decoupling of nest predator abundance and nest predation may create ecological traps in human-modified environments.

Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong

The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existingmore » graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.« less

Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis

DOE PAGES

Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong; ...

2016-01-01

The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existingmore » graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.« less

Nest Site Characteristics of Cavity Nesting Birds in Central Missouri

Treesearch

Jeffery D. Brawn; Bernice Tannenbaum; Keith E. Evans

1984-01-01

Two study sites in central Missouri oak-hickory forests were searched for nest sites of cavity nesting birds. Researchers located and measured 133 nests of 11 species. Cavity nesting bird habitat selection is affected by both snag characteristics and vegetation structure.

The nest-concealment hypothesis: New insights from a comparative analysis

USGS Publications Warehouse

Borgmann, Kathi L.; Conway, Courtney J.

2015-01-01

Selection of a breeding site is critical for many animals, especially for birds whose offspring are stationary during development. Thus, birds are often assumed to prefer concealed nest sites. However, 74% of studies (n = 106) that have evaluated this relationship for open-cup nesting songbirds in North America failed to support the nest-concealment hypothesis. We conducted a comparative analysis to identify factors that contribute to variation in the ability of researchers to find support for the nest-concealment hypothesis. We found that some of the discrepancy among studies can be explained by interspecific differences in morphological and extrinsic factors that affect nest predation. Moreover, methods that investigators used to estimate concealment affected whether studies found support for the nest-concealment hypothesis; 33% of the studies that used quantitative estimates found support for the nest-concealment hypothesis whereas only 10% of the studies that used qualitative estimates found support. The timing of measurements also explained some of the ambiguity; studies that provided little information regarding the timing of their foliage density estimates were less likely to support the nest-concealment hypothesis. Species with more conspicuous male plumage were less likely to support the nest-concealment hypothesis when we analyzed studies that used visual estimates. Whereas species with more conspicuous female plumage were more likely to support the nest-concealment hypothesis when we analyzed studies that used quantitative measures. Our results demonstrate that support for the nest-concealment hypothesis has been equivocal, but that some of the ambiguity can be explained by morphological traits and methods used to measure concealment.

Reflecting on Graphs: Attributes of Graph Choice and Construction Practices in Biology.

PubMed

Angra, Aakanksha; Gardner, Stephanie M

2017-01-01

Undergraduate biology education reform aims to engage students in scientific practices such as experimental design, experimentation, and data analysis and communication. Graphs are ubiquitous in the biological sciences, and creating effective graphical representations involves quantitative and disciplinary concepts and skills. Past studies document student difficulties with graphing within the contexts of classroom or national assessments without evaluating student reasoning. Operating under the metarepresentational competence framework, we conducted think-aloud interviews to reveal differences in reasoning and graph quality between undergraduate biology students, graduate students, and professors in a pen-and-paper graphing task. All professors planned and thought about data before graph construction. When reflecting on their graphs, professors and graduate students focused on the function of graphs and experimental design, while most undergraduate students relied on intuition and data provided in the task. Most undergraduate students meticulously plotted all data with scaled axes, while professors and some graduate students transformed the data, aligned the graph with the research question, and reflected on statistics and sample size. Differences in reasoning and approaches taken in graph choice and construction corroborate and extend previous findings and provide rich targets for undergraduate and graduate instruction. © 2017 A. Angra and S. M. Gardner. CBE—Life Sciences Education © 2017 The American Society for Cell Biology. This article is distributed by The American Society for Cell Biology under license from the author(s). It is available to the public under an Attribution–Noncommercial–Share Alike 3.0 Unported Creative Commons License (http://creativecommons.org/licenses/by-nc-sa/3.0).

Nest Predation Deviates from Nest Predator Abundance in an Ecologically Trapped Bird

PubMed Central

Hollander, Franck A.; Van Dyck, Hans; San Martin, Gilles; Titeux, Nicolas

2015-01-01

In human-modified environments, ecological traps may result from a preference for low-quality habitat where survival or reproductive success is lower than in high-quality habitat. It has often been shown that low reproductive success for birds in preferred habitat types was due to higher nest predator abundance. However, between-habitat differences in nest predation may only weakly correlate with differences in nest predator abundance. An ecological trap is at work in a farmland bird (Lanius collurio) that recently expanded its breeding habitat into open areas in plantation forests. This passerine bird shows a strong preference for forest habitat, but it has a higher nest success in farmland. We tested whether higher abundance of nest predators in the preferred habitat or, alternatively, a decoupling of nest predator abundance and nest predation explained this observed pattern of maladaptive habitat selection. More than 90% of brood failures were attributed to nest predation. Nest predator abundance was more than 50% higher in farmland, but nest predation was 17% higher in forest. Differences between nest predation on actual shrike nests and on artificial nests suggested that parent shrikes may facilitate nest disclosure for predators in forest more than they do in farmland. The level of caution by parent shrikes when visiting their nest during a simulated nest predator intrusion was the same in the two habitats, but nest concealment was considerably lower in forest, which contributes to explaining the higher nest predation in this habitat. We conclude that a decoupling of nest predator abundance and nest predation may create ecological traps in human-modified environments. PMID:26624619

Key-Node-Separated Graph Clustering and Layouts for Human Relationship Graph Visualization.

PubMed

Itoh, Takayuki; Klein, Karsten

2015-01-01

Many graph-drawing methods apply node-clustering techniques based on the density of edges to find tightly connected subgraphs and then hierarchically visualize the clustered graphs. However, users may want to focus on important nodes and their connections to groups of other nodes for some applications. For this purpose, it is effective to separately visualize the key nodes detected based on adjacency and attributes of the nodes. This article presents a graph visualization technique for attribute-embedded graphs that applies a graph-clustering algorithm that accounts for the combination of connections and attributes. The graph clustering step divides the nodes according to the commonality of connected nodes and similarity of feature value vectors. It then calculates the distances between arbitrary pairs of clusters according to the number of connecting edges and the similarity of feature value vectors and finally places the clusters based on the distances. Consequently, the technique separates important nodes that have connections to multiple large clusters and improves the visibility of such nodes' connections. To test this technique, this article presents examples with human relationship graph datasets, including a coauthorship and Twitter communication network dataset.

Well-Covered Graphs: A Survey

DTIC Science & Technology

1991-01-01

critical G’s/# G’s -) 0 as IV(G)I -- oo? References [B1] C. Berge, Regularizable graphs, Ann. Discrete Math ., 3, 1978, 11-19. [B2] _ _, Some common...Springer-Verlag, Berlin, 1980, 108-123. [B3] _ _, Some common properties for regularizable graphs, edge-critical graphs, and B-graphs, Ann. Discrete Math ., 12...graphs - an extension of the K6nig-Egervgiry theorem, Discrete Math ., 27, 1979, 23-33. [ER] M.N Ellingham and G.F. Royle, Well-covered cubic graphs

Spectral partitioning in equitable graphs.

PubMed

Barucca, Paolo

2017-06-01

Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e., random graphs with a block-regular structure, is studied, for which analytical results can be obtained. In particular, the spectral density of this ensemble is computed exactly for a modular and bipartite structure. Kesten-McKay's law for random regular graphs is found analytically to apply also for modular and bipartite structures when blocks are homogeneous. An exact solution to graph partitioning for two equal-sized communities is proposed and verified numerically, and a conjecture on the absence of an efficient recovery detectability transition in equitable graphs is suggested. A final discussion summarizes results and outlines their relevance for the solution of graph partitioning problems in other graph ensembles, in particular for the study of detectability thresholds and resolution limits in stochastic block models.

Spectral partitioning in equitable graphs

NASA Astrophysics Data System (ADS)

Barucca, Paolo

2017-06-01

Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e., random graphs with a block-regular structure, is studied, for which analytical results can be obtained. In particular, the spectral density of this ensemble is computed exactly for a modular and bipartite structure. Kesten-McKay's law for random regular graphs is found analytically to apply also for modular and bipartite structures when blocks are homogeneous. An exact solution to graph partitioning for two equal-sized communities is proposed and verified numerically, and a conjecture on the absence of an efficient recovery detectability transition in equitable graphs is suggested. A final discussion summarizes results and outlines their relevance for the solution of graph partitioning problems in other graph ensembles, in particular for the study of detectability thresholds and resolution limits in stochastic block models.

Factors Affecting Florida Scrub-Jay Nest Survival on Ocala National Forest, Florida

Treesearch

Kathleen Franzreb; Stan Zarnoch

2011-01-01

One of the main populations of the Florida scrub-jay (Aphelocoma coerulescens), a federally threatened species, occurs on Ocala National Forest, Florida. We determined the nest survival rate (DSR) of 474 nests of Florida scrub-jays in stands subject to sand pine reforestation management after timber harvesting or wildfire on Ocala National Forest. We used the...

Graph characterization via Ihara coefficients.

PubMed

Ren, Peng; Wilson, Richard C; Hancock, Edwin R

2011-02-01

The novel contributions of this paper are twofold. First, we demonstrate how to characterize unweighted graphs in a permutation-invariant manner using the polynomial coefficients from the Ihara zeta function, i.e., the Ihara coefficients. Second, we generalize the definition of the Ihara coefficients to edge-weighted graphs. For an unweighted graph, the Ihara zeta function is the reciprocal of a quasi characteristic polynomial of the adjacency matrix of the associated oriented line graph. Since the Ihara zeta function has poles that give rise to infinities, the most convenient numerically stable representation is to work with the coefficients of the quasi characteristic polynomial. Moreover, the polynomial coefficients are invariant to vertex order permutations and also convey information concerning the cycle structure of the graph. To generalize the representation to edge-weighted graphs, we make use of the reduced Bartholdi zeta function. We prove that the computation of the Ihara coefficients for unweighted graphs is a special case of our proposed method for unit edge weights. We also present a spectral analysis of the Ihara coefficients and indicate their advantages over other graph spectral methods. We apply the proposed graph characterization method to capturing graph-class structure and clustering graphs. Experimental results reveal that the Ihara coefficients are more effective than methods based on Laplacian spectra.

Constructing compact and effective graphs for recommender systems via node and edge aggregations

DOE PAGES

Lee, Sangkeun; Kahng, Minsuk; Lee, Sang-goo

2014-12-10

Exploiting graphs for recommender systems has great potential to flexibly incorporate heterogeneous information for producing better recommendation results. As our baseline approach, we first introduce a naive graph-based recommendation method, which operates with a heterogeneous log-metadata graph constructed from user log and content metadata databases. Although the na ve graph-based recommendation method is simple, it allows us to take advantages of heterogeneous information and shows promising flexibility and recommendation accuracy. However, it often leads to extensive processing time due to the sheer size of the graphs constructed from entire user log and content metadata databases. In this paper, we proposemore » node and edge aggregation approaches to constructing compact and e ective graphs called Factor-Item bipartite graphs by aggregating nodes and edges of a log-metadata graph. Furthermore, experimental results using real world datasets indicate that our approach can significantly reduce the size of graphs exploited for recommender systems without sacrificing the recommendation quality.« less

Is it safe to nest near conspicuous neighbours? Spatial patterns in predation risk associated with the density of American Golden-Plover nests

PubMed Central

Trottier-Paquet, Myriam; Bêty, Joël; Lamarre, Vincent; Lecomte, Nicolas

2016-01-01

Predation is one of the main factors explaining nesting mortality in most bird species. Birds can avoid nest predation or reduce predation pressure by breeding at higher latitude, showing anti-predator behaviour, selecting nest sites protected from predators, and nesting in association with protective species. American Golden-Plovers (Pluvialis dominica) defend their territory by using various warning and distraction behaviours displayed at varying levels of intensity (hereafter “conspicuous behaviour”), as well as more aggressive behaviours such as aerial attacks, but only in some populations. Such antipredator behaviour has the potential to repel predators and thus benefit the neighbouring nests by decreasing their predation risk. Yet, conspicuous behaviour could also attract predators by signalling the presence of a nest. To test for the existence of a protective effect associated with the conspicuous antipredator behaviour of American Golden-Plovers, we studied the influence of proximity to plover nests on predation risk of artificial nests on Igloolik Island (Nunavut, Canada) in July 2014. We predicted that the predation risk of artificial nests would decrease with proximity to and density of plover nests. We monitored 18 plover nests and set 35 artificial nests at 30, 50, 100, 200, and 500 m from seven of those plover nests. We found that the predation risk of artificial nests increases with the density of active plover nests. We also found a significant negative effect of the distance to the nearest active protector nest on predation risk of artificial nests. Understanding how the composition and structure of shorebird communities generate spatial patterns in predation risks represents a key step to better understand the importance of these species of conservation concern in tundra food webs. PMID:27602257

Is it safe to nest near conspicuous neighbours? Spatial patterns in predation risk associated with the density of American Golden-Plover nests.

PubMed

Giroux, Marie-Andrée; Trottier-Paquet, Myriam; Bêty, Joël; Lamarre, Vincent; Lecomte, Nicolas

2016-01-01

Predation is one of the main factors explaining nesting mortality in most bird species. Birds can avoid nest predation or reduce predation pressure by breeding at higher latitude, showing anti-predator behaviour, selecting nest sites protected from predators, and nesting in association with protective species. American Golden-Plovers (Pluvialis dominica) defend their territory by using various warning and distraction behaviours displayed at varying levels of intensity (hereafter "conspicuous behaviour"), as well as more aggressive behaviours such as aerial attacks, but only in some populations. Such antipredator behaviour has the potential to repel predators and thus benefit the neighbouring nests by decreasing their predation risk. Yet, conspicuous behaviour could also attract predators by signalling the presence of a nest. To test for the existence of a protective effect associated with the conspicuous antipredator behaviour of American Golden-Plovers, we studied the influence of proximity to plover nests on predation risk of artificial nests on Igloolik Island (Nunavut, Canada) in July 2014. We predicted that the predation risk of artificial nests would decrease with proximity to and density of plover nests. We monitored 18 plover nests and set 35 artificial nests at 30, 50, 100, 200, and 500 m from seven of those plover nests. We found that the predation risk of artificial nests increases with the density of active plover nests. We also found a significant negative effect of the distance to the nearest active protector nest on predation risk of artificial nests. Understanding how the composition and structure of shorebird communities generate spatial patterns in predation risks represents a key step to better understand the importance of these species of conservation concern in tundra food webs.

Fully Decomposable Split Graphs

NASA Astrophysics Data System (ADS)

Broersma, Hajo; Kratsch, Dieter; Woeginger, Gerhard J.

We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is fully decomposable, i.e., whether it can be partitioned into connected parts of order α 1,α 2,...,α k for every α 1,α 2,...,α k summing up to the order of the graph. In contrast, we show that the decision problem whether a given split graph can be partitioned into connected parts of order α 1,α 2,...,α k for a given partition α 1,α 2,...,α k of the order of the graph, is NP-hard.

BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.

PubMed

Vorburger, Robert S; Reischauer, Carolin; Boesiger, Peter

2013-02-01

Bootstrap methods have recently been introduced to diffusion-weighted magnetic resonance imaging to estimate the measurement uncertainty of ensuing diffusion parameters directly from the acquired data without the necessity to assume a noise model. These methods have been previously combined with deterministic streamline tractography algorithms to allow for the assessment of connection probabilities in the human brain. Thereby, the local noise induced disturbance in the diffusion data is accumulated additively due to the incremental progression of streamline tractography algorithms. Graph based approaches have been proposed to overcome this drawback of streamline techniques. For this reason, the bootstrap method is in the present work incorporated into a graph setup to derive a new probabilistic fiber tractography method, called BootGraph. The acquired data set is thereby converted into a weighted, undirected graph by defining a vertex in each voxel and edges between adjacent vertices. By means of the cone of uncertainty, which is derived using the wild bootstrap, a weight is thereafter assigned to each edge. Two path finding algorithms are subsequently applied to derive connection probabilities. While the first algorithm is based on the shortest path approach, the second algorithm takes all existing paths between two vertices into consideration. Tracking results are compared to an established algorithm based on the bootstrap method in combination with streamline fiber tractography and to another graph based algorithm. The BootGraph shows a very good performance in crossing situations with respect to false negatives and permits incorporating additional constraints, such as a curvature threshold. By inheriting the advantages of the bootstrap method and graph theory, the BootGraph method provides a computationally efficient and flexible probabilistic tractography setup to compute connection probability maps and virtual fiber pathways without the drawbacks of

Nests and nest sites of the San Miguel Island Song Sparrow

USGS Publications Warehouse

Kern, Michael D.; Sogge, Mark K.; Kern, Robert B.; van Riper, Charles

1993-01-01

Nests and nest sites of the San Miguel Island (SMI) Song Sparrow (Melospiza melodia micronyx) are described; nests are compared with those of 16 other races of Song Sparrows. Bush lupins (Lupinus albifrons), coyote brush (Baccharis pilularis) and golden bush (Haplopappus venetus) were the shrubs used most commonly as nest sites by Song Sparrows on SMI. As a result of its location, the nest was effectively concealed from gray foxes (Urocyon littoralis), the major predator of this sparrow. Nest and nest site also moderated the combined chilling effects of cool air temperatures and strong northwesterly winds on the eggs and nestlings. Even in the absence of these moderating effects of the nest site, the energetic cost of incubation, estimated at 41-53% of the sparrow's resting metabolic rate, was modest. Twenty-nine percent of the canopy above the nest was open and as much as 73% of the nest cup was in the sun at midday, a time when surface temperatures of foliage, nest and nestlings sometimes exceeded 40 C. Whereas this exposure did not apparently reduce fledging success, it may explain why the incidence of addled eggs was so high in this population of Song Sparrows compared to others. Significant differences existed among races of Song Sparrows in the size, porosity and insulation of the nest. In most cases, these differences were not related to the latitude of the races' nesting areas.

Graph Theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sanfilippo, Antonio P.

2005-12-27

Graph theory is a branch of discrete combinatorial mathematics that studies the properties of graphs. The theory was pioneered by the Swiss mathematician Leonhard Euler in the 18th century, commenced its formal development during the second half of the 19th century, and has witnessed substantial growth during the last seventy years, with applications in areas as diverse as engineering, computer science, physics, sociology, chemistry and biology. Graph theory has also had a strong impact in computational linguistics by providing the foundations for the theory of features structures that has emerged as one of the most widely used frameworks for themore » representation of grammar formalisms.« less

A graph regularized non-negative matrix factorization method for identifying microRNA-disease associations.

PubMed

Xiao, Qiu; Luo, Jiawei; Liang, Cheng; Cai, Jie; Ding, Pingjian

2017-09-01

MicroRNAs (miRNAs) play crucial roles in post-transcriptional regulations and various cellular processes. The identification of disease-related miRNAs provides great insights into the underlying pathogenesis of diseases at a system level. However, most existing computational approaches are biased towards known miRNA-disease associations, which is inappropriate for those new diseases or miRNAs without any known association information. In this study, we propose a new method with graph regularized non-negative matrix factorization in heterogeneous omics data, called GRNMF, to discover potential associations between miRNAs and diseases, especially for new diseases and miRNAs or those diseases and miRNAs with sparse known associations. First, we integrate the disease semantic information and miRNA functional information to estimate disease similarity and miRNA similarity, respectively. Considering that there is no available interaction observed for new diseases or miRNAs, a preprocessing step is developed to construct the interaction score profiles that will assist in prediction. Next, a graph regularized non-negative matrix factorization framework is utilized to simultaneously identify potential associations for all diseases. The results indicated that our proposed method can effectively prioritize disease-associated miRNAs with higher accuracy compared with other recent approaches. Moreover, case studies also demonstrated the effectiveness of GRNMF to infer unknown miRNA-disease associations for those novel diseases and miRNAs. The code of GRNMF is freely available at https://github.com/XIAO-HN/GRNMF/. Supplementary data are available at Bioinformatics online. © The Author (2017). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com

Interactive effects between nest microclimate and nest vegetation structure confirm microclimate thresholds for Lesser Prairie-Chicken nest survival

USGS Publications Warehouse

Grisham, Blake A.; Godar, Alixandra J.; Boal, Clint W.; Haukos, David A.

2016-01-01

The range of Lesser Prairie-Chickens (Tympanuchus pallidicinctus) spans 4 unique ecoregions along 2 distinct environmental gradients. The Sand Shinnery Oak Prairie ecoregion of the Southern High Plains of New Mexico and Texas is environmentally isolated, warmer, and more arid than the Short-Grass, Sand Sagebrush, and Mixed-Grass Prairie ecoregions in Colorado, Kansas, Oklahoma, and the northeast panhandle of Texas. Weather is known to influence Lesser Prairie-Chicken nest survival in the Sand Shinnery Oak Prairie ecoregion; regional variation may also influence nest microclimate and, ultimately, survival during incubation. To address this question, we placed data loggers adjacent to nests during incubation to quantify temperature and humidity distribution functions in 3 ecoregions. We developed a suite of a priori nest survival models that incorporated derived microclimate parameters and visual obstruction as covariates in Program MARK. We monitored 49 nests in Mixed-Grass, 22 nests in Sand Shinnery Oak, and 30 nests in Short-Grass ecoregions from 2010 to 2014. Our findings indicated that (1) the Sand Shinnery Oak Prairie ecoregion was hotter and drier during incubation than the Mixed- and Short-Grass ecoregions; (2) nest microclimate varied among years within ecoregions; (3) visual obstruction was positively associated with nest survival; but (4) daily nest survival probability decreased by 10% every half-hour when temperature was greater than 34°C and vapor pressure deficit was less than −23 mmHg during the day (about 0600–2100 hours). Our major finding confirmed microclimate thresholds for nest survival under natural conditions across the species' distribution, although Lesser Prairie-Chickens are more likely to experience microclimate conditions that result in nest failures in the Sand Shinnery Oak Prairie ecoregion. The species would benefit from identification of thermal landscapes and management actions that promote cooler, more humid nest microclimates.

Nest Mosquito Trap quantifies contact rates between nesting birds and mosquitoes.

PubMed

Caillouët, Kevin A; Riggan, Anna E; Rider, Mark; Bulluck, Lesley P

2012-06-01

Accurate estimates of host-vector contact rates are required for precise determination of arbovirus transmission intensity. We designed and tested a novel mosquito collection device, the Nest Mosquito Trap (NMT), to collect mosquitoes as they attempt to feed on unrestrained nesting birds in artificial nest boxes. In the laboratory, the NMT collected nearly one-third of the mosquitoes introduced to the nest boxes. We then used these laboratory data to estimate our capture efficiency of field-collected bird-seeking mosquitoes collected over 66 trap nights. We estimated that 7.5 mosquitoes per trap night attempted to feed on nesting birds in artificial nest boxes. Presence of the NMT did not have a negative effect on avian nest success when compared to occupied nest boxes that were not sampled with the trap. Future studies using the NMT may elucidate the role of nestlings in arbovirus transmission and further refine estimates of nesting bird and vector contact rates. © 2012 The Society for Vector Ecology.

Nest Mosquito Trap quantifies contact rates between nesting birds and mosquitoes

PubMed Central

Caillouët, Kevin A.; Riggan, Anna E.; Rider, Mark; Bulluck, Lesley P.

2012-01-01

Accurate estimates of host-vector contact rates are required for precise determination of arbovirus transmission intensity. We designed and tested a novel mosquito collection device, the Nest Mosquito Trap (NMT), to collect mosquitoes as they attempt to feed on unrestrained nesting birds in artificial nest boxes. In the laboratory, the NMT collected nearly one-third of the mosquitoes introduced to the nest boxes. We then used these laboratory data to estimate our capture efficiency of field-collected bird-seeking mosquitoes collected over 66 trap nights. We estimated that 7.5 mosquitoes per trap night attempted to feed on nesting birds in artificial nest boxes. Presence of the NMT did not have a negative effect on avian nest success when compared to occupied nest boxes that were not sampled with the trap. Future studies using the NMT may elucidate the role of nestlings in arbovirus transmission and further refine estimates of nesting bird and vector contact rates. PMID:22548555

Less is less: a systematic review of graph use in meta-analyses.

PubMed

Schild, Anne H E; Voracek, Martin

2013-09-01

Graphs are an essential part of scientific communication. Complex datasets, of which meta-analyses are textbook examples, benefit the most from visualization. Although a number of graph options for meta-analyses exist, the extent to which these are used was hitherto unclear. A systematic review on graph use in meta-analyses in three disciplines (medicine, psychology, and business) and nine journals was conducted. Interdisciplinary differences, which are mirrored in the respective journals, were revealed, that is, graph use correlates with external factors rather than methodological considerations. There was only limited variation in graph types (with forest plots as the most important representatives), and diagnostic plots were very rare. Although an increase in graph use over time could be observed, it is unlikely that this phenomenon is specific to meta-analyses. There is a gaping discrepancy between available graphic methods and their application in meta-analyses. This may be rooted in a number of factors, namely, (i) insufficient dissemination of new developments, (ii) unsatisfactory implementation in software packages, and (iii) minor attention on graphics in meta-analysis reporting guidelines. Using visualization methods to their full capacity is a further step in using meta-analysis to its full potential. Copyright © 2013 John Wiley & Sons, Ltd.

On the modification Highly Connected Subgraphs (HCS) algorithm in graph clustering for weighted graph

NASA Astrophysics Data System (ADS)

Albirri, E. R.; Sugeng, K. A.; Aldila, D.

2018-04-01

Nowadays, in the modern world, since technology and human civilization start to progress, all city in the world is almost connected. The various places in this world are easier to visit. It is an impact of transportation technology and highway construction. The cities which have been connected can be represented by graph. Graph clustering is one of ways which is used to answer some problems represented by graph. There are some methods in graph clustering to solve the problem spesifically. One of them is Highly Connected Subgraphs (HCS) method. HCS is used to identify cluster based on the graph connectivity k for graph G. The connectivity in graph G is denoted by k(G)> \\frac{n}{2} that n is the total of vertices in G, then it is called as HCS or the cluster. This research used literature review and completed with simulation of program in a software. We modified HCS algorithm by using weighted graph. The modification is located in the Process Phase. Process Phase is used to cut the connected graph G into two subgraphs H and \\bar{H}. We also made a program by using software Octave-401. Then we applied the data of Flight Routes Mapping of One of Airlines in Indonesia to our program.

Waterbird nest density and nest survival in rice fields of southwestern Louisiana

USGS Publications Warehouse

Pierluissi, S.; King, Sammy L.; Kaller, Michael D.

2010-01-01

Rice fields in southwestern Louisiana provide breeding habitat for several waterbird species; however, little is known about nest density, nest survival and the importance of landscape context of rice fields in determining breeding activity. In 2004, 42 rice fields were searched for nests, and 40 were searched in 2005. Land uses surrounding rice fields, including irrigation canals, trees, crawfish ponds, rice, fallow and soybean fields, were examined to determine influence on nest density and survival. Nest densities were 13.5-16.0 nests/km2 for Purple Gallinules (Porphyrio martinica), 3.0-13.7 nests/km2 for Fulvous Whistling Ducks (Dendrocygna bicolor), 2.6-2.8 nests/km2 for Common Moorhens (Gallinula chloropus), 0.3-0.92 nests/km2 for Least Bitterns (Ixobrychus exilisi) and 0-0.6 nests/km2 for Mottled Ducks (Anas fulvigula). Nest survival was 52-79% for Purple Gallinules and 39-43% for Fulvous Whistling Ducks. Apparent nest success of Common Moorhens was 73-75%, 83% for Least Bitterns and 33% for Mottled Ducks. Purple Gallinule and Common Moorhen nest densities were highest in fields with a larger proportion of irrigation canals surrounding rice fields. Purple Gallinule nest densities were greater in fields devoid of trees and landscapes dominated by rice fields and pasture, rather than landscapes containing soybean fields and residential areas. Fulvous Whistling Duck nest densities were higher in agriculturally-dominated landscapes with few trees.

Mathematical foundations of the GraphBLAS

DOE PAGES

Kepner, Jeremy; Aaltonen, Peter; Bader, David; ...

2016-12-01

The GraphBLAS standard (GraphBlas.org) is being developed to bring the potential of matrix-based graph algorithms to the broadest possible audience. Mathematically, the GraphBLAS defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This study provides an introduction to the mathematics of the GraphBLAS. Graphs represent connections between vertices with edges. Matrices can represent a wide range of graphs using adjacency matrices or incidence matrices. Adjacency matrices are often easier to analyze while incidence matrices are often better for representing data. Fortunately, themore » two are easily connected by matrix multiplication. A key feature of matrix mathematics is that a very small number of matrix operations can be used to manipulate a very wide range of graphs. This composability of a small number of operations is the foundation of the GraphBLAS. A standard such as the GraphBLAS can only be effective if it has low performance overhead. Finally, performance measurements of prototype GraphBLAS implementations indicate that the overhead is low.« less

Matching Extension in Regular Graphs

DTIC Science & Technology

1989-01-01

Plummer, Matching Theory, Ann. Discrete Math . 29, North- Holland, Amsterdam, 1986. [101 , The matching structure of graphs: some recent re- sults...maximums d’un graphe, These, Dr. troisieme cycle, Univ. Grenoble, 1978. [12 ] D. Naddef and W.R. Pulleyblank, Matching in regular graphs, Discrete Math . 34...1981, 283-291. [13 1 M.D. Plummer, On n-extendable graphs, Discrete Math . 31, 1980, 201-210. . [ 141 ,Matching extension in planar graphs IV

A review of the nest protection hypothesis: does inclusion of fresh green plant material in birds' nests reduce parasite infestation?

PubMed

Scott-Baumann, James F; Morgan, Eric R

2015-07-01

The use of aromatic plants and their essential oils for ectoparasite treatment is a field of growing interest. Several species of birds regularly introduce aromatic herbs into their nests putatively to reduce parasites. The behaviour is most often seen in cavity nesting birds and after nest building has finished. The plants are included in a non-structural manner and are often strongly aromatic. Various different hypotheses have been proposed regarding the function of this behaviour; from the plants altering some non-living factor in the nest (crypsis, water loss and insulation hypotheses) to them being involved in mate selection (mate hypothesis) or even having a beneficial effect, direct or indirect, on chicks (drug or nest protection hypothesis, NPH). Many studies have been carried out over the years observing and experimentally testing these hypotheses. This review focuses on studies involving the most popular of these hypotheses, the NPH: that plants decrease nest parasites or pathogens, thereby conveying positive effects to the chicks, allowing the behaviour to evolve. Studies providing observational evidence towards this hypothesis and those experimentally testing it are discussed.

Graphing the order of the sexes: constructing, recalling, interpreting, and putting the self in gender difference graphs.

PubMed

Hegarty, Peter; Lemieux, Anthony F; McQueen, Grant

2010-03-01

Graphs seem to connote facts more than words or tables do. Consequently, they seem unlikely places to spot implicit sexism at work. Yet, in 6 studies (N = 741), women and men constructed (Study 1) and recalled (Study 2) gender difference graphs with men's data first, and graphed powerful groups (Study 3) and individuals (Study 4) ahead of weaker ones. Participants who interpreted graph order as evidence of author "bias" inferred that the author graphed his or her own gender group first (Study 5). Women's, but not men's, preferences to graph men first were mitigated when participants graphed a difference between themselves and an opposite-sex friend prior to graphing gender differences (Study 6). Graph production and comprehension are affected by beliefs and suppositions about the groups represented in graphs to a greater degree than cognitive models of graph comprehension or realist models of scientific thinking have yet acknowledged.

Comparison and Enumeration of Chemical Graphs

PubMed Central

Akutsu, Tatsuya; Nagamochi, Hiroshi

2013-01-01

Chemical compounds are usually represented as graph structured data in computers. In this review article, we overview several graph classes relevant to chemical compounds and the computational complexities of several fundamental problems for these graph classes. In particular, we consider the following problems: determining whether two chemical graphs are identical, determining whether one input chemical graph is a part of the other input chemical graph, finding a maximum common part of two input graphs, finding a reaction atom mapping, enumerating possible chemical graphs, and enumerating stereoisomers. We also discuss the relationship between the fifth problem and kernel functions for chemical compounds. PMID:24688697

A Semantic Graph Query Language

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kaplan, I L

2006-10-16

Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.

Attributed community mining using joint general non-negative matrix factorization with graph Laplacian

NASA Astrophysics Data System (ADS)

Chen, Zigang; Li, Lixiang; Peng, Haipeng; Liu, Yuhong; Yang, Yixian

2018-04-01

Community mining for complex social networks with link and attribute information plays an important role according to different application needs. In this paper, based on our proposed general non-negative matrix factorization (GNMF) algorithm without dimension matching constraints in our previous work, we propose the joint GNMF with graph Laplacian (LJGNMF) to implement community mining of complex social networks with link and attribute information according to different application needs. Theoretical derivation result shows that the proposed LJGNMF is fully compatible with previous methods of integrating traditional NMF and symmetric NMF. In addition, experimental results show that the proposed LJGNMF can meet the needs of different community minings by adjusting its parameters, and the effect is better than traditional NMF in the community vertices attributes entropy.

Mourning Dove nesting habitat and nest success in Central Missouri

USGS Publications Warehouse

Drobney, R.D.; Schulz, J.H.; Sheriff, S.L.; Fuemmeler, W.J.

1998-01-01

Previous Mourning Dove (Zenaida macroura) nesting studies conducted in areas containing a mixture of edge and continuous habitats have focused on edge habitats. Consequently, little is known about the potential contribution of continuous habitats to dove production. In this study we evaluated the relative importance of these two extensive habitat types by monitoring the habitat use and nest success of 59 radio-marked doves during 1990-1991 in central Missouri. Of 83 nests initiated by our marked sample, most (81.9%) were located in edge habitats. Although continuous habitats were selected less as nest sites, the proportion of successful nests did not differ significantly from that in edge habitats. Our data indicate that continuous habitats should not be considered marginal nesting habitat. If the intensity of use and nest success that we observed are representative regionally or nationally, continuous habitats could contribute substantially to annual Mourning Dove production because of the high availability of these habitats throughout much of the Mourning Dove breeding range.

GoFFish: A Sub-Graph Centric Framework for Large-Scale Graph Analytics1

DOE Office of Scientific and Technical Information (OSTI.GOV)

Simmhan, Yogesh; Kumbhare, Alok; Wickramaarachchi, Charith

2014-08-25

Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ratio and slow convergence of iterative superstep. In this paper we introduce GoFFish a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters. We introduce a sub-graph centric programming abstraction that combines themore » scalability of a vertex centric approach with the flexibility of shared memory sub-graph computation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation.« less

Soil attributes drive nest-site selection by the campo miner Geositta poeciloptera.

PubMed

Meireles, Ricardo Camargos de; Teixeira, João Paulo Gusmão; Solar, Ricardo; Vasconcelos, Bruno Nery F; Fernandes, Raphael B A; Lopes, Leonardo Esteves

2018-01-01

Substrate type is a key-factor in nest-site selection and nest architecture of burrowing birds. However, little is known about which factors drive nest-site selection for these species, especially in the tropics. We studied the influence of soil attributes on nest-site selection by the campo miner Geositta poeciloptera, an open grassland bird that builds its nests within soil cavities. For all nests found, we measured the depth of the nest cavity and the resistance of the soil to penetration, and identified the soil horizon in which the nest was located. In soil banks with nests, we collected soil samples for granulometric analysis around each nest cavity, while in soil banks without nests we collected these samples at random points. From 43 nests found, 86% were located in the deeper soil horizons (C-horizon), and only 14% in the shallower horizons (B-horizon). Granulometric analysis showed that the C-horizons possessed a high similar granulometric composition, with high silt and low clay contents. These characteristics are associated with a low degree of structural development of the soil, which makes it easier to excavate. Contrarily, soil resistance to penetration does not seem to be an important criterion for nest site selection, although nests in more resistant the soils tend to have shallower nest cavities. Among the soil banks analyzed, 40% of those without cavities possessed a larger proportion of B-horizon relative to the C-horizon, and their texture was more clayey. On the other hand, almost all soil banks containing nest cavities had a larger C-horizon and a silty texture, indicating that soil attributes drive nest-site selection by G. poeciloptera. Thus, we conclude that the patchy distribution of G. poeciloptera can attributed to the infrequent natural exposure of the C-horizon in the tropical region, where well developed, deep and permeable soils are more common.

Soil attributes drive nest-site selection by the campo miner Geositta poeciloptera

PubMed Central

Teixeira, João Paulo Gusmão; Solar, Ricardo; Vasconcelos, Bruno Nery F.; Fernandes, Raphael B. A.; Lopes, Leonardo Esteves

2018-01-01

Substrate type is a key-factor in nest-site selection and nest architecture of burrowing birds. However, little is known about which factors drive nest-site selection for these species, especially in the tropics. We studied the influence of soil attributes on nest-site selection by the campo miner Geositta poeciloptera, an open grassland bird that builds its nests within soil cavities. For all nests found, we measured the depth of the nest cavity and the resistance of the soil to penetration, and identified the soil horizon in which the nest was located. In soil banks with nests, we collected soil samples for granulometric analysis around each nest cavity, while in soil banks without nests we collected these samples at random points. From 43 nests found, 86% were located in the deeper soil horizons (C-horizon), and only 14% in the shallower horizons (B-horizon). Granulometric analysis showed that the C-horizons possessed a high similar granulometric composition, with high silt and low clay contents. These characteristics are associated with a low degree of structural development of the soil, which makes it easier to excavate. Contrarily, soil resistance to penetration does not seem to be an important criterion for nest site selection, although nests in more resistant the soils tend to have shallower nest cavities. Among the soil banks analyzed, 40% of those without cavities possessed a larger proportion of B-horizon relative to the C-horizon, and their texture was more clayey. On the other hand, almost all soil banks containing nest cavities had a larger C-horizon and a silty texture, indicating that soil attributes drive nest-site selection by G. poeciloptera. Thus, we conclude that the patchy distribution of G. poeciloptera can attributed to the infrequent natural exposure of the C-horizon in the tropical region, where well developed, deep and permeable soils are more common. PMID:29381768

GraphPrints: Towards a Graph Analytic Method for Network Anomaly Detection

DOE Office of Scientific and Technical Information (OSTI.GOV)

Harshaw, Chris R; Bridges, Robert A; Iannacone, Michael D

This paper introduces a novel graph-analytic approach for detecting anomalies in network flow data called \\textit{GraphPrints}. Building on foundational network-mining techniques, our method represents time slices of traffic as a graph, then counts graphlets\\textemdash small induced subgraphs that describe local topology. By performing outlier detection on the sequence of graphlet counts, anomalous intervals of traffic are identified, and furthermore, individual IPs experiencing abnormal behavior are singled-out. Initial testing of GraphPrints is performed on real network data with an implanted anomaly. Evaluation shows false positive rates bounded by 2.84\\% at the time-interval level, and 0.05\\% at the IP-level with 100\\% truemore » positive rates at both.« less

Massive Scale Cyber Traffic Analysis: A Driver for Graph Database Research

DOE Office of Scientific and Technical Information (OSTI.GOV)

Joslyn, Cliff A.; Choudhury, S.; Haglin, David J.

2013-06-19

We describe the significance and prominence of network traffic analysis (TA) as a graph- and network-theoretical domain for advancing research in graph database systems. TA involves observing and analyzing the connections between clients, servers, hosts, and actors within IP networks, both at particular times and as extended over times. Towards that end, NetFlow (or more generically, IPFLOW) data are available from routers and servers which summarize coherent groups of IP packets flowing through the network. IPFLOW databases are routinely interrogated statistically and visualized for suspicious patterns. But the ability to cast IPFLOW data as a massive graph and query itmore » interactively, in order to e.g.\\ identify connectivity patterns, is less well advanced, due to a number of factors including scaling, and their hybrid nature combining graph connectivity and quantitative attributes. In this paper, we outline requirements and opportunities for graph-structured IPFLOW analytics based on our experience with real IPFLOW databases. Specifically, we describe real use cases from the security domain, cast them as graph patterns, show how to express them in two graph-oriented query languages SPARQL and Datalog, and use these examples to motivate a new class of "hybrid" graph-relational systems.« less

Florida Harvester Ant Nest Architecture, Nest Relocation and Soil Carbon Dioxide Gradients

PubMed Central

Tschinkel, Walter R.

2013-01-01

Colonies of the Florida harvester ant, Pogonomyrmex badius, excavate species-typical subterranean nests up the 3 m deep with characteristic vertical distribution of chamber area/shape, spacing between levels and vertical arrangement of the ants by age and brood stage. Colonies excavate and occupy a new nest about once a year, and doing so requires that they have information about the depth below ground. Careful excavation and mapping of vacated and new nests revealed that there was no significant difference between the old and new nests in any measure of nest size, shape or arrangement. Colonies essentially built a replicate of the just-vacated nest (although details differed), and they did so in less than a week. The reason for nest relocation is not apparent. Tschinkel noted that the vertical distribution of chamber area, worker age and brood type was strongly correlated to the soil carbon dioxide gradient, and proposed that this gradient serves as a template for nest excavation and vertical distribution. To test this hypothesis, the carbon dioxide gradient of colonies that were just beginning to excavate a new nest was eliminated by boring 6 vent holes around the forming nest, allowing the soil CO2 to diffuse into the atmosphere and eliminating the gradient. Sadly, neither the nest architecture nor the vertical ant distribution of vented nests differed from either unvented control or from their own vacated nest. In a stronger test, workers excavated a new nest under a reversed carbon dioxide gradient (high concentration near the surface, low below). Even under these conditions, the new and old nests did not differ significantly, showing that the soil carbon dioxide gradient does not serve as a template for nest construction or vertical worker distribution. The possible importance of soil CO2 gradients for soil-dwelling animals is discussed. PMID:23555829

Seasonal variation in nest placement of Abert's Towhees

Treesearch

Deborah M. Finch

1983-01-01

Several meteorological variables are known to influence the heat budgets of nesting birds (e.g., Walsberg and King 1978a, b). Such factors include air temperature, incident radiation, wind, and humidity. If the microclimate of the nest is unfavorable, parent birds may become inattentive, exposing eggs or nestlings to excessive heat or cold. They may then desert the...

Construction patterns of birds' nests provide insight into nest-building behaviours.

PubMed

Biddle, Lucia; Goodman, Adrian M; Deeming, D Charles

2017-01-01

Previous studies have suggested that birds and mammals select materials needed for nest building based on their thermal or structural properties, although the amounts or properties of the materials used have been recorded for only a very small number of species. Some of the behaviours underlying the construction of nests can be indirectly determined by careful deconstruction of the structure and measurement of the biomechanical properties of the materials used. Here we examined this idea in an investigation of Bullfinch ( Pyrrhula pyrrhula ) nests as a model for open-nesting songbird species that construct a "twig" nest, and tested the hypothesis that materials in different parts of nests serve different functions. The quantities of materials present in the nest base, sides and cup were recorded before structural analysis. Structural analysis showed that the base of the outer nests were composed of significantly thicker, stronger and more rigid materials compared to the side walls, which in turn were significantly thicker, stronger and more rigid than materials used in the cup. These results suggest that the placement of particular materials in nests may not be random, but further work is required to determine if the final structure of a nest accurately reflects the construction process.

Construction patterns of birds’ nests provide insight into nest-building behaviours

PubMed Central

Goodman, Adrian M.

2017-01-01

Previous studies have suggested that birds and mammals select materials needed for nest building based on their thermal or structural properties, although the amounts or properties of the materials used have been recorded for only a very small number of species. Some of the behaviours underlying the construction of nests can be indirectly determined by careful deconstruction of the structure and measurement of the biomechanical properties of the materials used. Here we examined this idea in an investigation of Bullfinch (Pyrrhula pyrrhula) nests as a model for open-nesting songbird species that construct a “twig” nest, and tested the hypothesis that materials in different parts of nests serve different functions. The quantities of materials present in the nest base, sides and cup were recorded before structural analysis. Structural analysis showed that the base of the outer nests were composed of significantly thicker, stronger and more rigid materials compared to the side walls, which in turn were significantly thicker, stronger and more rigid than materials used in the cup. These results suggest that the placement of particular materials in nests may not be random, but further work is required to determine if the final structure of a nest accurately reflects the construction process. PMID:28265501

Graphs and Tracks Revisited

NASA Astrophysics Data System (ADS)

Christian, Wolfgang; Belloni, Mario

2013-04-01

We have recently developed a Graphs and Tracks model based on an earlier program by David Trowbridge, as shown in Fig. 1. Our model can show position, velocity, acceleration, and energy graphs and can be used for motion-to-graphs exercises. Users set the heights of the track segments, and the model displays the motion of the ball on the track together with position, velocity, and acceleration graphs. This ready-to-run model is available in the ComPADRE OSP Collection at www.compadre.org/osp/items/detail.cfm?ID=12023.

Helping Students Make Sense of Graphs: An Experimental Trial of SmartGraphs Software

ERIC Educational Resources Information Center

Zucker, Andrew; Kay, Rachel; Staudt, Carolyn

2014-01-01

Graphs are commonly used in science, mathematics, and social sciences to convey important concepts; yet students at all ages demonstrate difficulties interpreting graphs. This paper reports on an experimental study of free, Web-based software called SmartGraphs that is specifically designed to help students overcome their misconceptions regarding…

Graphing Inequalities, Connecting Meaning

ERIC Educational Resources Information Center

Switzer, J. Matt

2014-01-01

Students often have difficulty with graphing inequalities (see Filloy, Rojano, and Rubio 2002; Drijvers 2002), and J. Matt Switzer's students were no exception. Although students can produce graphs for simple inequalities, they often struggle when the format of the inequality is unfamiliar. Even when producing a correct graph of an…

On Edge Exchangeable Random Graphs

NASA Astrophysics Data System (ADS)

Janson, Svante

2017-06-01

We study a recent model for edge exchangeable random graphs introduced by Crane and Dempsey; in particular we study asymptotic properties of the random simple graph obtained by merging multiple edges. We study a number of examples, and show that the model can produce dense, sparse and extremely sparse random graphs. One example yields a power-law degree distribution. We give some examples where the random graph is dense and converges a.s. in the sense of graph limit theory, but also an example where a.s. every graph limit is the limit of some subsequence. Another example is sparse and yields convergence to a non-integrable generalized graphon defined on (0,∞).

Spectral fluctuations of quantum graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pluhař, Z.; Weidenmüller, H. A.

We prove the Bohigas-Giannoni-Schmit conjecture in its most general form for completely connected simple graphs with incommensurate bond lengths. We show that for graphs that are classically mixing (i.e., graphs for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap), the generating functions for all (P,Q) correlation functions for both closed and open graphs coincide (in the limit of infinite graph size) with the corresponding expressions of random-matrix theory, both for orthogonal and for unitary symmetry.

Multiple graph regularized protein domain ranking.

PubMed

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-11-19

Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Private Graphs - Access Rights on Graphs for Seamless Navigation

NASA Astrophysics Data System (ADS)

Dorner, W.; Hau, F.; Pagany, R.

2016-06-01

After the success of GNSS (Global Navigational Satellite Systems) and navigation services for public streets, indoor seems to be the next big development in navigational services, relying on RTLS - Real Time Locating Services (e.g. WIFI) and allowing seamless navigation. In contrast to navigation and routing services on public streets, seamless navigation will cause an additional challenge: how to make routing data accessible to defined users or restrict access rights for defined areas or only to parts of the graph to a defined user group? The paper will present case studies and data from literature, where seamless and especially indoor navigation solutions are presented (hospitals, industrial complexes, building sites), but the problem of restricted access rights was only touched from a real world, but not a technical perspective. The analysis of case studies will show, that the objective of navigation and the different target groups for navigation solutions will demand well defined access rights and require solutions, how to make only parts of a graph to a user or application available to solve a navigational task. The paper will therefore introduce the concept of private graphs, which is defined as a graph for navigational purposes covering the street, road or floor network of an area behind a public street and suggest different approaches how to make graph data for navigational purposes available considering access rights and data protection, privacy and security issues as well.

Effects of spatial disturbance on common loon nest site selection and territory success

USGS Publications Warehouse

McCarthy, K.P.; DeStefano, S.

2011-01-01

The common loon (Gavia immer) breeds during the summer on northern lakes and water bodies that are also often desirable areas for aquatic recreation and human habitation. In northern New England, we assessed how the spatial nature of disturbance affects common loon nest site selection and territory success. We found through classification and regression analysis that distance to and density of disturbance factors can be used to classify observed nest site locations versus random points, suggesting that these factors affect loon nest site selection (model 1: Correct classification = 75%, null = 50%, K = 0.507, P < 0.001; model 2: Correct classification = 78%, null = 50%, K = 0.551, P < 0.001). However, in an exploratory analysis, we were unable to show a relation between spatial disturbance variables and breeding success (P = 0.595, R 2 = 0.436), possibly because breeding success was so low during the breeding seasons of 2007-2008. We suggest that by selecting nest site locations that avoid disturbance factors, loons thereby limit the effect that disturbance will have on their breeding success. Still, disturbance may force loons to use sub-optimal nesting habitat, limiting the available number of territories, and overall productivity. We advise that management efforts focus on limiting disturbance factors to allow breeding pairs access to the best nesting territories, relieving disturbance pressures that may force sub-optimal nest placement. ?? 2011 The Wildlife Society.

Multiple directed graph large-class multi-spectral processor

NASA Technical Reports Server (NTRS)

Casasent, David; Liu, Shiaw-Dong; Yoneyama, Hideyuki

1988-01-01

Numerical analysis techniques for the interpretation of high-resolution imaging-spectrometer data are described and demonstrated. The method proposed involves the use of (1) a hierarchical classifier with a tree structure generated automatically by a Fisher linear-discriminant-function algorithm and (2) a novel multiple-directed-graph scheme which reduces the local maxima and the number of perturbations required. Results for a 500-class test problem involving simulated imaging-spectrometer data are presented in tables and graphs; 100-percent-correct classification is achieved with an improvement factor of 5.

Graph Visualization for RDF Graphs with SPARQL-EndPoints

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sukumar, Sreenivas R; Bond, Nathaniel

2014-07-11

RDF graphs are hard to visualize as triples. This software module is a web interface that connects to a SPARQL endpoint and retrieves graph data that the user can explore interactively and seamlessly. The software written in python and JavaScript has been tested to work on screens as little as the smart phones to large screens such as EVEREST.

Nest survival is influenced by parental behaviour and heterospecifics in a mixed-species colony

USGS Publications Warehouse

Brussee, Brianne E.; Coates, Peter S.; Hothem, Roger L.; Howe, Kristy; Casazza, Michael L.; Eadie, John M.

2016-01-01

Studies of avian nest success often focus on examining influences of variation in environmental and seasonal factors. However, in-depth evaluations can also incorporate variation in individual incubation behaviour to further advance our understanding of avian reproductive ecology. We examined these relationships in colonially nesting Black-crowned Night-Herons Nycticorax nycticorax using intensive video-monitoring methods to quantify incubation behaviours. We modelled nest survival as a function of both extrinsic factors and incubation behaviours over a 3-year period (2010–12) on Alcatraz Island, USA. Model-averaged parameter estimates indicated that nest survival increased as a function of greater incubation constancy (% of time spent incubating eggs within a 24-h period), and average daily precipitation throughout the nesting stage. Common Ravens Corvus corax are the only known nest predator of Night-Herons on Alcatraz Island, as on many other coastal Pacific islands. We also investigated the effects of heterospecific nesting of California Gulls Larus californicus and Western Gulls Larus occidentalis in a mixed-species colony with Night-Herons, based on nesting proximity data collected over a 2-year period (2011–12). This second analysis indicated that, in addition to incubation behaviours, nesting heterospecifics are an important factor for explaining variation in Night-Heron nest survival. However, contrary to our original expectation, we found that Night-Herons experienced increased nest survival with increasing distance from gull colony boundaries. These results may apply to other areas with multiple colonial nesting species and similar predator communities and climatic patterns.

Multiple graph regularized protein domain ranking

PubMed Central

2012-01-01

Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. PMID:23157331

Predation of Songbird Nests Differs By Predator and Between Field and Forest Habitats

Treesearch

Frank R., III Thompson; Dirk E. Burhans

2003-01-01

Our understanding of factors affecting nest predation and ability to mitigate high nest predation rates is hampered by a lack of information on the importance of various nest predator species in different habitats and landscapes. We identified predators of songbird nests in old-field and forest habitats in central Missouri, USA, with miniature video cameras. We used an...

Determinants of abundance and effects of blood-sucking flying insects in the nest of a hole-nesting bird.

PubMed

Tomás, Gustavo; Merino, Santiago; Martínez-de la Puente, Josué; Moreno, Juan; Morales, Judith; Lobato, Elisa

2008-05-01

Compared to non-flying nest-dwelling ectoparasites, the biology of most species of flying ectoparasites and its potential impact on avian hosts is poorly known and rarely, if ever, reported. In this study we explore for the first time the factors that may affect biting midge (Diptera: Ceratopogonidae) and black fly (Diptera: Simuliidae) abundances in the nest cavity of a bird, the hole-nesting blue tit Cyanistes caeruleus, and report their effects on adults and nestlings during reproduction. The abundance of biting midges was positively associated with nest mass, parental provisioning effort and abundance of blowflies and black flies, while negatively associated with nestling condition. Furthermore, a medication treatment to reduce blood parasitaemias in adult birds revealed that biting midges were more abundant in nests of females whose blood parasitaemias were experimentally reduced. This finding would be in accordance with these insect vectors attacking preferentially uninfected or less infected hosts to increase their own survival. The abundance of black flies in the population was lower than that of biting midges and increased in nests with later hatching dates. No significant effect of black fly abundance on adult or nestling condition was detected. Blood-sucking flying insects may impose specific, particular selection pressures on their hosts and more research is needed to better understand these host-parasite associations.

Characterizing Containment and Related Classes of Graphs,

DTIC Science & Technology

1985-01-01

Math . to appear. [G2] Golumbic,. Martin C., D. Rotem and J. Urrutia. "Comparability graphs and intersection graphs" Discrete Math . 43 (1983) 37-40. [G3...intersection classes of graphs" Discrete Math . to appear. [S2] Scheinerman, Edward R. Intersection Classes and Multiple Intersection Parameters of Graphs...graphs and of interval graphs" Canad. Jour. of blath. 16 (1964) 539-548. [G1] Golumbic, Martin C. "Containment graphs: and. intersection graphs" Discrete

A Collection of Features for Semantic Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Eliassi-Rad, T; Fodor, I K; Gallagher, B

2007-05-02

Semantic graphs are commonly used to represent data from one or more data sources. Such graphs extend traditional graphs by imposing types on both nodes and links. This type information defines permissible links among specified nodes and can be represented as a graph commonly referred to as an ontology or schema graph. Figure 1 depicts an ontology graph for data from National Association of Securities Dealers. Each node type and link type may also have a list of attributes. To capture the increased complexity of semantic graphs, concepts derived for standard graphs have to be extended. This document explains brieflymore » features commonly used to characterize graphs, and their extensions to semantic graphs. This document is divided into two sections. Section 2 contains the feature descriptions for static graphs. Section 3 extends the features for semantic graphs that vary over time.« less

JavaGenes: Evolving Graphs with Crossover

NASA Technical Reports Server (NTRS)

Globus, Al; Atsatt, Sean; Lawton, John; Wipke, Todd

2000-01-01

Genetic algorithms usually use string or tree representations. We have developed a novel crossover operator for a directed and undirected graph representation, and used this operator to evolve molecules and circuits. Unlike strings or trees, a single point in the representation cannot divide every possible graph into two parts, because graphs may contain cycles. Thus, the crossover operator is non-trivial. A steady-state, tournament selection genetic algorithm code (JavaGenes) was written to implement and test the graph crossover operator. All runs were executed by cycle-scavagging on networked workstations using the Condor batch processing system. The JavaGenes code has evolved pharmaceutical drug molecules and simple digital circuits. Results to date suggest that JavaGenes can evolve moderate sized drug molecules and very small circuits in reasonable time. The algorithm has greater difficulty with somewhat larger circuits, suggesting that directed graphs (circuits) are more difficult to evolve than undirected graphs (molecules), although necessary differences in the crossover operator may also explain the results. In principle, JavaGenes should be able to evolve other graph-representable systems, such as transportation networks, metabolic pathways, and computer networks. However, large graphs evolve significantly slower than smaller graphs, presumably because the space-of-all-graphs explodes combinatorially with graph size. Since the representation strongly affects genetic algorithm performance, adding graphs to the evolutionary programmer's bag-of-tricks should be beneficial. Also, since graph evolution operates directly on the phenotype, the genotype-phenotype translation step, common in genetic algorithm work, is eliminated.

Stationary waves on nonlinear quantum graphs. II. Application of canonical perturbation theory in basic graph structures.

PubMed

Gnutzmann, Sven; Waltner, Daniel

2016-12-01

We consider exact and asymptotic solutions of the stationary cubic nonlinear Schrödinger equation on metric graphs. We focus on some basic example graphs. The asymptotic solutions are obtained using the canonical perturbation formalism developed in our earlier paper [S. Gnutzmann and D. Waltner, Phys. Rev. E 93, 032204 (2016)2470-004510.1103/PhysRevE.93.032204]. For closed example graphs (interval, ring, star graph, tadpole graph), we calculate spectral curves and show how the description of spectra reduces to known characteristic functions of linear quantum graphs in the low-intensity limit. Analogously for open examples, we show how nonlinear scattering of stationary waves arises and how it reduces to known linear scattering amplitudes at low intensities. In the short-wavelength asymptotics we discuss how genuine nonlinear effects may be described using the leading order of canonical perturbation theory: bifurcation of spectral curves (and the corresponding solutions) in closed graphs and multistability in open graphs.

Species and temporal factors affect predator-specific rates of nest predation for forest songbirds in the midwest

Treesearch

W. Andrew Cox; Frank R. III Thompson; John Faaborg

2012-01-01

Knowledge of the relative contributions of predator species to overall rates of nest predation can improve our understanding of why predation risk varies, but the identity of predators is seldom known. We used video technology to identify nest predators of the tree-nesting Acadian Flycatcher (Empidonax virescens) and the shrub-nesting Indigo Bunting...

Sorting it out: bedding particle size and nesting material processing method affect nest complexity.

PubMed

Robinson-Junker, Amy; Morin, Amelia; Pritchett-Corning, Kathleen; Gaskill, Brianna N

2017-04-01

As part of routine husbandry, an increasing number of laboratory mice receive nesting material in addition to standard bedding material in their cages. Nesting material improves health outcomes and physiological performance in mice that receive it. Providing usable nesting material uniformly and efficiently to various strains of mice remains a challenge. The aim of this study was to determine how bedding particle size, method of nesting material delivery, and processing of the nesting material before delivery affected nest building in mice of strong (BALB/cAnNCrl) and weak (C3H/HeNCrl) gathering abilities. Our data suggest that processing nesting material through a grinder in conjunction with bedding material, although convenient for provision of bedding with nesting material 'built-in', negatively affects the integrity of the nesting material and subsequent nest-building outcomes. We also found that C3H mice, previously thought to be poor nest builders, built similarly scored nests to those of BALB/c mice when provided with unprocessed nesting material. This was true even when nesting material was mixed into the bedding substrate. We also observed that when nesting material was mixed into the bedding substrate, mice of both strains would sort their bedding by particle size more often than if it were not mixed in. Our findings support the utility of the practice of distributing nesting material mixed in with bedding substrate, but not that of processing the nesting material with the bedding in order to mix them.

Molecular graph convolutions: moving beyond fingerprints.

PubMed

Kearnes, Steven; McCloskey, Kevin; Berndl, Marc; Pande, Vijay; Riley, Patrick

2016-08-01

Molecular "fingerprints" encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the molecular structure while ignoring others, rather than allowing the model to make data-driven decisions. We describe molecular graph convolutions, a machine learning architecture for learning from undirected graphs, specifically small molecules. Graph convolutions use a simple encoding of the molecular graph-atoms, bonds, distances, etc.-which allows the model to take greater advantage of information in the graph structure. Although graph convolutions do not outperform all fingerprint-based methods, they (along with other graph-based methods) represent a new paradigm in ligand-based virtual screening with exciting opportunities for future improvement.

Information visualisation based on graph models

NASA Astrophysics Data System (ADS)

Kasyanov, V. N.; Kasyanova, E. V.

2013-05-01

Information visualisation is a key component of support tools for many applications in science and engineering. A graph is an abstract structure that is widely used to model information for its visualisation. In this paper, we consider practical and general graph formalism called hierarchical graphs and present the Higres and Visual Graph systems aimed at supporting information visualisation on the base of hierarchical graph models.

Network reconstruction via graph blending

NASA Astrophysics Data System (ADS)

Estrada, Rolando

2016-05-01

Graphs estimated from empirical data are often noisy and incomplete due to the difficulty of faithfully observing all the components (nodes and edges) of the true graph. This problem is particularly acute for large networks where the number of components may far exceed available surveillance capabilities. Errors in the observed graph can render subsequent analyses invalid, so it is vital to develop robust methods that can minimize these observational errors. Errors in the observed graph may include missing and spurious components, as well fused (multiple nodes are merged into one) and split (a single node is misinterpreted as many) nodes. Traditional graph reconstruction methods are only able to identify missing or spurious components (primarily edges, and to a lesser degree nodes), so we developed a novel graph blending framework that allows us to cast the full estimation problem as a simple edge addition/deletion problem. Armed with this framework, we systematically investigate the viability of various topological graph features, such as the degree distribution or the clustering coefficients, and existing graph reconstruction methods for tackling the full estimation problem. Our experimental results suggest that incorporating any topological feature as a source of information actually hinders reconstruction accuracy. We provide a theoretical analysis of this phenomenon and suggest several avenues for improving this estimation problem.

Effects of spatial disturbance on common loon nest site selection and territory success

USGS Publications Warehouse

McCarthy, Kyle P.; DeStefano, Stephen

2011-01-01

The common loon (Gavia immer) breeds during the summer on northern lakes and water bodies that are also often desirable areas for aquatic recreation and human habitation. In northern New England, we assessed how the spatial nature of disturbance affects common loon nest site selection and territory success. We found through classification and regression analysis that distance to and density of disturbance factors can be used to classify observed nest site locations versus random points, suggesting that these factors affect loon nest site selection (model 1: Correct classification = 75%, null = 50%, K = 0.507, P < 0.001; model 2: Correct classification = 78%, null = 50%, K = 0.551, P < 0.001). However, in an exploratory analysis, we were unable to show a relation between spatial disturbance variables and breeding success (P = 0.595, R2 = 0.436), possibly because breeding success was so low during the breeding seasons of 2007–2008. We suggest that by selecting nest site locations that avoid disturbance factors, loons thereby limit the effect that disturbance will have on their breeding success. Still, disturbance may force loons to use sub-optimal nesting habitat, limiting the available number of territories, and overall productivity. We advise that management efforts focus on limiting disturbance factors to allow breeding pairs access to the best nesting territories, relieving disturbance pressures that may force sub-optimal nest placement.

Estimating nest detection probabilities for white-winged dove nest transects in Tamaulipas, Mexico

USGS Publications Warehouse

Nichols, J.D.; Tomlinson, R.E.; Waggerman, G.

1986-01-01

Nest transects in nesting colonies provide one source of information on White-winged Dove (Zenaida asiatica asiatica) population status and reproduction. Nests are counted along transects using standardized field methods each year in Texas and northeastern Mexico by personnel associated with Mexico's Office of Flora and Fauna, the Texas Parks and Wildlife Department, and the U.S. Fish and Wildlife Service. Nest counts on transects are combined with information on the size of nesting colonies to estimate total numbers of nests in sampled colonies. Historically, these estimates have been based on the actual nest counts on transects and thus have required the assumption that all nests lying within transect boundaries are detected (seen) with a probability of one. Our objectives were to test the hypothesis that nest detection probability is one and, if rejected, to estimate this probability.

Graph Kernels for Molecular Similarity.

PubMed

Rupp, Matthias; Schneider, Gisbert

2010-04-12

Molecular similarity measures are important for many cheminformatics applications like ligand-based virtual screening and quantitative structure-property relationships. Graph kernels are formal similarity measures defined directly on graphs, such as the (annotated) molecular structure graph. Graph kernels are positive semi-definite functions, i.e., they correspond to inner products. This property makes them suitable for use with kernel-based machine learning algorithms such as support vector machines and Gaussian processes. We review the major types of kernels between graphs (based on random walks, subgraphs, and optimal assignments, respectively), and discuss their advantages, limitations, and successful applications in cheminformatics. Copyright © 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Groupies in multitype random graphs.

PubMed

Shang, Yilun

2016-01-01

A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.

Community detection enhancement using non-negative matrix factorization with graph regularization

NASA Astrophysics Data System (ADS)

Liu, Xiao; Wei, Yi-Ming; Wang, Jian; Wang, Wen-Jun; He, Dong-Xiao; Song, Zhan-Jie

2016-06-01

Community detection is a meaningful task in the analysis of complex networks, which has received great concern in various domains. A plethora of exhaustive studies has made great effort and proposed many methods on community detection. Particularly, a kind of attractive one is the two-step method which first makes a preprocessing for the network and then identifies its communities. However, not all types of methods can achieve satisfactory results by using such preprocessing strategy, such as the non-negative matrix factorization (NMF) methods. In this paper, rather than using the above two-step method as most works did, we propose a graph regularized-based model to improve, specialized, the NMF-based methods for the detection of communities, namely NMFGR. In NMFGR, we introduce the similarity metric which contains both the global and local information of networks, to reflect the relationships between two nodes, so as to improve the accuracy of community detection. Experimental results on both artificial and real-world networks demonstrate the superior performance of NMFGR to some competing methods.

Graph mining for next generation sequencing: leveraging the assembly graph for biological insights.

PubMed

Warnke-Sommer, Julia; Ali, Hesham

2016-05-06

The assembly of Next Generation Sequencing (NGS) reads remains a challenging task. This is especially true for the assembly of metagenomics data that originate from environmental samples potentially containing hundreds to thousands of unique species. The principle objective of current assembly tools is to assemble NGS reads into contiguous stretches of sequence called contigs while maximizing for both accuracy and contig length. The end goal of this process is to produce longer contigs with the major focus being on assembly only. Sequence read assembly is an aggregative process, during which read overlap relationship information is lost as reads are merged into longer sequences or contigs. The assembly graph is information rich and capable of capturing the genomic architecture of an input read data set. We have developed a novel hybrid graph in which nodes represent sequence regions at different levels of granularity. This model, utilized in the assembly and analysis pipeline Focus, presents a concise yet feature rich view of a given input data set, allowing for the extraction of biologically relevant graph structures for graph mining purposes. Focus was used to create hybrid graphs to model metagenomics data sets obtained from the gut microbiomes of five individuals with Crohn's disease and eight healthy individuals. Repetitive and mobile genetic elements are found to be associated with hybrid graph structure. Using graph mining techniques, a comparative study of the Crohn's disease and healthy data sets was conducted with focus on antibiotics resistance genes associated with transposase genes. Results demonstrated significant differences in the phylogenetic distribution of categories of antibiotics resistance genes in the healthy and diseased patients. Focus was also evaluated as a pure assembly tool and produced excellent results when compared against the Meta-velvet, Omega, and UD-IDBA assemblers. Mining the hybrid graph can reveal biological phenomena captured

Graphs to estimate an individualized risk of breast cancer.

PubMed

Benichou, J; Gail, M H; Mulvihill, J J

1996-01-01

Clinicians who counsel women about their risk for developing breast cancer need a rapid method to estimate individualized risk (absolute risk), as well as the confidence limits around that point. The Breast Cancer Detection Demonstration Project (BCDDP) model (sometimes called the Gail model) assumes no genetic model and simultaneously incorporates five risk factors, but involves cumbersome calculations and interpolations. This report provides graphs to estimate the absolute risk of breast cancer from the BCDDP model. The BCDDP recruited 280,000 women from 1973 to 1980 who were monitored for 5 years. From this cohort, 2,852 white women developed breast cancer and 3,146 controls were selected, all with complete risk-factor information. The BCDDP model, previously developed from these data, was used to prepare graphs that relate a specific summary relative-risk estimate to the absolute risk of developing breast cancer over intervals of 10, 20, and 30 years. Once a summary relative risk is calculated, the appropriate graph is chosen that shows the 10-, 20-, or 30-year absolute risk of developing breast cancer. A separate graph gives the 95% confidence limits around the point estimate of absolute risk. Once a clinician rules out a single gene trait that predisposes to breast cancer and elicits information on age and four risk factors, the tables and figures permit an estimation of a women's absolute risk of developing breast cancer in the next three decades. These results are intended to be applied to women who undergo regular screening. They should be used only in a formal counseling program to maximize a woman's understanding of the estimates and the proper use of them.

A Novel Graph Constructor for Semisupervised Discriminant Analysis: Combined Low-Rank and k-Nearest Neighbor Graph

PubMed Central

Pan, Yongke; Niu, Wenjia

2017-01-01

Semisupervised Discriminant Analysis (SDA) is a semisupervised dimensionality reduction algorithm, which can easily resolve the out-of-sample problem. Relative works usually focus on the geometric relationships of data points, which are not obvious, to enhance the performance of SDA. Different from these relative works, the regularized graph construction is researched here, which is important in the graph-based semisupervised learning methods. In this paper, we propose a novel graph for Semisupervised Discriminant Analysis, which is called combined low-rank and k-nearest neighbor (LRKNN) graph. In our LRKNN graph, we map the data to the LR feature space and then the kNN is adopted to satisfy the algorithmic requirements of SDA. Since the low-rank representation can capture the global structure and the k-nearest neighbor algorithm can maximally preserve the local geometrical structure of the data, the LRKNN graph can significantly improve the performance of SDA. Extensive experiments on several real-world databases show that the proposed LRKNN graph is an efficient graph constructor, which can largely outperform other commonly used baselines. PMID:28316616

How numbers of nesting sea turtles can be overestimated by nearly a factor of two

PubMed Central

Esteban, Nicole; Mortimer, Jeanne A.

2017-01-01

Estimating the absolute number of individuals in populations and their fecundity is central to understanding the ecosystem role of species and their population dynamics as well as allowing informed conservation management for endangered species. Estimates of abundance and fecundity are often difficult to obtain for rare or cryptic species. Yet, in addition, here we show for a charismatic group, sea turtles, that are neither cryptic nor rare and whose nesting is easy to observe, that the traditional approach of direct observations of nesting has likely led to a gross overestimation of the number of individuals in populations and underestimation of their fecundity. We use high-resolution GPS satellite tags to track female green turtles throughout their nesting season in the Chagos Archipelago (Indian Ocean) and assess when and where they nested. For individual turtles, nest locations were often spread over several tens of kilometres of coastline. Assessed by satellite observations, a mean of 6.0 clutches (range 2–9, s.d. = 2.2) was laid by individuals, about twice as many as previously assumed, a finding also reported in other species and ocean basins. Taken together, these findings suggest that the actual number of nesting turtles may be almost 50% less than previously assumed. PMID:28202810

How numbers of nesting sea turtles can be overestimated by nearly a factor of two.

PubMed

Esteban, Nicole; Mortimer, Jeanne A; Hays, Graeme C

2017-02-22

Estimating the absolute number of individuals in populations and their fecundity is central to understanding the ecosystem role of species and their population dynamics as well as allowing informed conservation management for endangered species. Estimates of abundance and fecundity are often difficult to obtain for rare or cryptic species. Yet, in addition, here we show for a charismatic group, sea turtles, that are neither cryptic nor rare and whose nesting is easy to observe, that the traditional approach of direct observations of nesting has likely led to a gross overestimation of the number of individuals in populations and underestimation of their fecundity. We use high-resolution GPS satellite tags to track female green turtles throughout their nesting season in the Chagos Archipelago (Indian Ocean) and assess when and where they nested. For individual turtles, nest locations were often spread over several tens of kilometres of coastline. Assessed by satellite observations, a mean of 6.0 clutches (range 2-9, s.d. = 2.2) was laid by individuals, about twice as many as previously assumed, a finding also reported in other species and ocean basins. Taken together, these findings suggest that the actual number of nesting turtles may be almost 50% less than previously assumed. © 2017 The Author(s).

Can selection on nest size from nest predation explain the latitudinal gradient in clutch size?

PubMed

Biancucci, Luis; Martin, Thomas E

2010-09-01

1. Latitudinal variation in clutch sizes of birds is a well described, but poorly understood pattern. Many hypotheses have been proposed, but few have been experimentally tested, and none have been universally accepted by researchers. 2. The nest size hypothesis posits that higher nest predation in the tropics favours selection for smaller nests and thereby constrains clutch size by shrinking available space for eggs and/or nestlings in the nest. We tested this hypothesis with an experiment in a tropical forest and a comparative study between temperate and tropical field sites. 3. Specifically, we tested if: (i) predation increased with nest size; (ii) tropical birds had smaller nests controlled for body size; and (iii) clutch size was explained by nest size controlled for body size. 4. Experimental swapping of nests of different sizes showed that nest predation increased with nest size in the tropical site. Moreover, nest predation rates were higher in species with larger nests in both sites. However, nest size, corrected for body mass and phylogeny, did not differ between sites and was not related to clutch size between sites. 5. Hence, nest predation can exert selection on nest size as predicted by the hypothesis. Nest size increased with adult body mass, such that adult size might indirectly influence reproductive success through effects on nest size and nest predation risk. Ultimately, however, selection from nest predation on nest size does not explain the smaller clutch sizes typical of the tropics.

Can selection on nest size from nest predation explain the latitudinal gradient in clutch size?

USGS Publications Warehouse

Biancucci, L.; Martin, T.E.

2010-01-01

1. Latitudinal variation in clutch sizes of birds is a well described, but poorly understood pattern. Many hypotheses have been proposed, but few have been experimentally tested, and none have been universally accepted by researchers. 2. The nest size hypothesis posits that higher nest predation in the tropics favours selection for smaller nests and thereby constrains clutch size by shrinking available space for eggs and/or nestlings in the nest. We tested this hypothesis with an experiment in a tropical forest and a comparative study between temperate and tropical field sites. 3. Specifically, we tested if: (i) predation increased with nest size; (ii) tropical birds had smaller nests controlled for body size; and (iii) clutch size was explained by nest size controlled for body size. 4. Experimental swapping of nests of different sizes showed that nest predation increased with nest size in the tropical site. Moreover, nest predation rates were higher in species with larger nests in both sites. However, nest size, corrected for body mass and phylogeny, did not differ between sites and was not related to clutch size between sites. 5. Hence, nest predation can exert selection on nest size as predicted by the hypothesis. Nest size increased with adult body mass, such that adult size might indirectly influence reproductive success through effects on nest size and nest predation risk. Ultimately, however, selection from nest predation on nest size does not explain the smaller clutch sizes typical of the tropics.

Biotic and abiotic factors affect the nest environment of embryonic leatherback turtles, Dermochelys coriacea.

PubMed

Wallace, Bryan P; Sotherland, Paul R; Spotila, James R; Reina, Richard D; Franks, Bryan F; Paladino, Frank V

2004-01-01

Clutches of leatherback turtles, Dermochelys coriacea, have lower hatching success than those of other sea turtles, but causes of high embryonic mortality are unknown. We measured characteristics of clutches along with spatial and temporal changes in PO(2) and temperature during incubation to determine the extent to which they affected the developmental environment of leatherback embryos. Minimum PO(2) in nests decreased as both the total number and mass of metabolizing embryos increased. Increases in both the number and mass of metabolizing embryos caused an increase in maximum nest temperature. However, neither PO(2) nor temperature was correlated with hatching success. Our measurements of relatively high nest PO(2) (lowest 17.1 kPa or 16.9% O(2)) indicate that hypoxia apparently does not cause the low hatching success of leatherback clutches. Oxygen partial pressure increased and temperature decreased from the center toward the periphery of leatherback nests. We inferred from these measurements that positions of eggs within nests vary in quality and potentially affect overall developmental success of entire clutches. The large metabolic mass of leatherback clutches and limits to gas flux imposed by the sand create a situation in which leatherback embryos collectively affect their own environment.

Individual variation in nest size and nest site features of the Bornean orangutans (Pongo pygmaeus).

PubMed

Rayadin, Yaya; Saitoh, Takashi

2009-05-01

Nest construction is a daily habit of independent orangutans for sleeping or resting. Data on their nests have been used in various ecological studies (e.g., density estimation, ranging behavior, evolution of material culture) because they are the most observable field signs. We investigated nest size and nest site features of Bornean orangutans in the wild during 10 months' fieldwork at three sites in East Kalimantan, Indonesia: Kutai National Park, Birawa, and Meratus. To examine individual variation, we followed 31 individual orangutans and recorded the 92 nests they made for nest size (diameter) and nest site features (height of nest above ground, tree species used for the nest site, the diameter and height of the tree, whether the nest was new or reused, and nest location within the tree). Analyses taking age-sex classes of the focal individuals into consideration showed significant age-sex differences in nest size and location, but not in nest height or nest tree features (diameter, height of tree, and height of lowest branch). Mature orangutans (adult females, unflanged and flanged males) made larger nests than immatures (juveniles and adolescents). Flanged male orangutans with larger nests used stable locations for nesting sites and reused old nests more frequently than immatures. The overall proportion of nests in open (exposed) locations was higher than in closed (sheltered) locations. Flanged males and immatures frequently made open nests, whereas adult females with an infant preferred closed locations. The good correspondence between nest size and age-sex classes indicates that nest size variation may reflect body size and therefore age-sex variation in the population. (c) 2009 Wiley-Liss, Inc.

Pre-nesting and nesting behavior of the Swainson's warbler

USGS Publications Warehouse

Meanley, B.

1969-01-01

The Swainson?s Warbler is one of the least known of southern birds. Although fairly common in some parts of its summer range, observations of its breeding biology have been made by very few persons. The present study was conducted mostly at Macon, Georgia; Pendleton Ferry, Arkansas; and Dismal Swamp, Virginia....In central Georgia and east-central Arkansas, Swainson?s Warblers usually arrive on their territories during the first two weeks in April. Territories in several localities ranged in size from 0.3 to 4.8 acres. A color-marked Arkansas male occupied the same territory for at least four months. Hostile encounters between territorial male Swainson?s Warblers usually take place along the boundary of adjacent territories. Paired males were more aggressive than unpaired males. Toward the end of an encounter one of the two males would usually perform a display in which the wing and tail feathers were spread and the tail vibrated. Following boundary encounters males drifted back onto their territories and usually sang unbroken courses of songs for several minutes.....During pre-nesting at Macon, a mated pair spent the day mostly on the ground within 20 feet of each other, often foragin g 3 to 4 feet apart. What may have been a form of courtship display, in which the male flew from a perch down to the female and either pecked her rump or pounced on her, occurred about three times each hour throughout the day. During this period the male sang less than at other times during the breeding season.....First nests are usually built by the first week in May. Although other investigators reported finding nests of this species outside of the defended territory, all nests that I have found were within the territory. The large, bulky nest of this species usually is placed 2-6 feet above the ground. It is built by the female from materials gathered close to the nest site; and takes two or three days to complete.....Three and occasionally four white eggs are laid. The female

TrajGraph: A Graph-Based Visual Analytics Approach to Studying Urban Network Centralities Using Taxi Trajectory Data.

PubMed

Huang, Xiaoke; Zhao, Ye; Yang, Jing; Zhang, Chong; Ma, Chao; Ye, Xinyue

2016-01-01

We propose TrajGraph, a new visual analytics method, for studying urban mobility patterns by integrating graph modeling and visual analysis with taxi trajectory data. A special graph is created to store and manifest real traffic information recorded by taxi trajectories over city streets. It conveys urban transportation dynamics which can be discovered by applying graph analysis algorithms. To support interactive, multiscale visual analytics, a graph partitioning algorithm is applied to create region-level graphs which have smaller size than the original street-level graph. Graph centralities, including Pagerank and betweenness, are computed to characterize the time-varying importance of different urban regions. The centralities are visualized by three coordinated views including a node-link graph view, a map view and a temporal information view. Users can interactively examine the importance of streets to discover and assess city traffic patterns. We have implemented a fully working prototype of this approach and evaluated it using massive taxi trajectories of Shenzhen, China. TrajGraph's capability in revealing the importance of city streets was evaluated by comparing the calculated centralities with the subjective evaluations from a group of drivers in Shenzhen. Feedback from a domain expert was collected. The effectiveness of the visual interface was evaluated through a formal user study. We also present several examples and a case study to demonstrate the usefulness of TrajGraph in urban transportation analysis.

Temporal Representation in Semantic Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Levandoski, J J; Abdulla, G M

2007-08-07

A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.

Mapping risk for nest predation on a barrier island

USGS Publications Warehouse

Hackney, Amanda D.; Baldwin, Robert F.; Jodice, Patrick G.R.

2013-01-01

Barrier islands and coastal beach systems provide nesting habitat for marine and estuarine turtles. Densely settled coastal areas may subsidize nest predators. Our purpose was to inform conservation by providing a greater understanding of habitat-based risk factors for nest predation, for an estuarine turtle. We expected that habitat conditions at predated nests would differ from random locations at two spatial extents. We developed and validated an island-wide model for the distribution of predated Diamondback terrapin nests using locations of 198 predated nests collected during exhaustive searches at Fisherman Island National Wildlife Refuge, USA. We used aerial photographs to identify all areas of possible nesting habitat and searched each and surrounding environments for nests, collecting location and random-point microhabitat data. We built models for the probability of finding a predated nest using an equal number of random points and validated them with a reserve set (N = 67). Five variables in 9 a priori models were used and the best selected model (AIC weight 0.98) reflected positive associations with sand patches near marshes and roadways. Model validation had an average capture rate of predated nests of 84.14 % (26.17–97.38 %, Q1 77.53 %, median 88.07 %, Q3 95.08 %). Microhabitat selection results suggest that nests placed at the edges of sand patches adjacent to upland shrub/forest and marsh systems are vulnerable to predation. Forests and marshes provide cover and alternative resources for predators and roadways provide access; a suggestion is to focus nest protection efforts on the edges of dunes, near dense vegetation and roads.

Do Predation Rates on Artificial Nests Accurately Reflect Predation Rates on Natural Bird Nests?

Treesearch

David I. King; Richard M. DeGraaf; Curtice R. Griffin; Thomas J. Maier

1999-01-01

Artificial nests are widely used in avian field studies. However, it is unclear how well predation rates on artificial nests reflect predation rates on natural nests. Therefore, we compared survival rates of artificial nests (unused natural nests baited with House Sparrow eggs) with survival rates of active bird nests in the same habitat at the same sites. Survival...

Topologies on directed graphs

NASA Technical Reports Server (NTRS)

Lieberman, R. N.

1972-01-01

Given a directed graph, a natural topology is defined and relationships between standard topological properties and graph theoretical concepts are studied. In particular, the properties of connectivity and separatedness are investigated. A metric is introduced which is shown to be related to separatedness. The topological notions of continuity and homeomorphism. A class of maps is studied which preserve both graph and topological properties. Applications involving strong maps and contractions are also presented.

Walking Out Graphs

ERIC Educational Resources Information Center

Shen, Ji

2009-01-01

In the Walking Out Graphs Lesson described here, students experience several types of representations used to describe motion, including words, sentences, equations, graphs, data tables, and actions. The most important theme of this lesson is that students have to understand the consistency among these representations and form the habit of…

Quantum walk on a chimera graph

NASA Astrophysics Data System (ADS)

Xu, Shu; Sun, Xiangxiang; Wu, Jizhou; Zhang, Wei-Wei; Arshed, Nigum; Sanders, Barry C.

2018-05-01

We analyse a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum walk features such as localization that starkly distinguishes classical from quantum behaviour. Motivated by technological thrusts, we study continuous-time quantum walk on enhanced variants of the chimera graph and on diminished chimera graph with a random removal of vertices. We explain the quantum walk by constructing a generating set for a suitable subgroup of graph isomorphisms and corresponding symmetry operators that commute with the quantum walk Hamiltonian; the Hamiltonian and these symmetry operators provide a complete set of labels for the spectrum and the stationary states. Our quantum walk characterization of the chimera graph and its variants yields valuable insights into graphs used for designing quantum-annealers.

Graph-Based Object Class Discovery

NASA Astrophysics Data System (ADS)

Xia, Shengping; Hancock, Edwin R.

We are interested in the problem of discovering the set of object classes present in a database of images using a weakly supervised graph-based framework. Rather than making use of the ”Bag-of-Features (BoF)” approach widely used in current work on object recognition, we represent each image by a graph using a group of selected local invariant features. Using local feature matching and iterative Procrustes alignment, we perform graph matching and compute a similarity measure. Borrowing the idea of query expansion , we develop a similarity propagation based graph clustering (SPGC) method. Using this method class specific clusters of the graphs can be obtained. Such a cluster can be generally represented by using a higher level graph model whose vertices are the clustered graphs, and the edge weights are determined by the pairwise similarity measure. Experiments are performed on a dataset, in which the number of images increases from 1 to 50K and the number of objects increases from 1 to over 500. Some objects have been discovered with total recall and a precision 1 in a single cluster.

What Would a Graph Look Like in this Layout? A Machine Learning Approach to Large Graph Visualization.

PubMed

Kwon, Oh-Hyun; Crnovrsanin, Tarik; Ma, Kwan-Liu

2018-01-01

Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a "good" layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.

Nest predation risk influences a cavity-nesting passerine during the post-hatching care period

PubMed Central

Yoon, Jongmin; Kim, Byung-Su; Joo, Eun-Jin; Park, Shi-Ryong

2016-01-01

Some nest predators visually assess parental activities to locate a prey nest, whereas parents modify fitness-related traits to reduce the probability of nest predation, and/or nestlings fledge early to escape the risky nest environment. Here, we experimentally tested if the parental and fledging behaviours of oriental tits (Parus minor) that bred in the nest-box varied with cavity conditions associated with nest predation risk during the nestling period. The entrance of experimental nest-boxes was enlarged to create a long-term risk soon after clutch competition. A short-term risk, using simulated playbacks with a coexisting control bird and avian nest predator sound, was simultaneously applied to the nest-boxes whether or not the long-term risk existed. We found that the parents reduced their hourly feeding trips, and the nestlings fledged early with the long-term risk, although the nest mortality of the two nest-box types was low and did not differ. While this study presents a portion of prey–predator interactions with the associated uncertainties, our results highlight that the entrance size of cavities for small hole-nesting birds may play an important role in determining their fitness-related traits depending upon the degree of perceived risk of nest predation. PMID:27553176

Nest predation risk influences a cavity-nesting passerine during the post-hatching care period.

PubMed

Yoon, Jongmin; Kim, Byung-Su; Joo, Eun-Jin; Park, Shi-Ryong

2016-08-24

Some nest predators visually assess parental activities to locate a prey nest, whereas parents modify fitness-related traits to reduce the probability of nest predation, and/or nestlings fledge early to escape the risky nest environment. Here, we experimentally tested if the parental and fledging behaviours of oriental tits (Parus minor) that bred in the nest-box varied with cavity conditions associated with nest predation risk during the nestling period. The entrance of experimental nest-boxes was enlarged to create a long-term risk soon after clutch competition. A short-term risk, using simulated playbacks with a coexisting control bird and avian nest predator sound, was simultaneously applied to the nest-boxes whether or not the long-term risk existed. We found that the parents reduced their hourly feeding trips, and the nestlings fledged early with the long-term risk, although the nest mortality of the two nest-box types was low and did not differ. While this study presents a portion of prey-predator interactions with the associated uncertainties, our results highlight that the entrance size of cavities for small hole-nesting birds may play an important role in determining their fitness-related traits depending upon the degree of perceived risk of nest predation.

Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks

NASA Astrophysics Data System (ADS)

Ma, Xiaoke; Sun, Penggang; Wang, Yu

2018-04-01

Many networks derived from society and nature are temporal and incomplete. The temporal link prediction problem in networks is to predict links at time T + 1 based on a given temporal network from time 1 to T, which is essential to important applications. The current algorithms either predict the temporal links by collapsing the dynamic networks or collapsing features derived from each network, which are criticized for ignoring the connection among slices. to overcome the issue, we propose a novel graph regularized nonnegative matrix factorization algorithm (GrNMF) for the temporal link prediction problem without collapsing the dynamic networks. To obtain the feature for each network from 1 to t, GrNMF factorizes the matrix associated with networks by setting the rest networks as regularization, which provides a better way to characterize the topological information of temporal links. Then, the GrNMF algorithm collapses the feature matrices to predict temporal links. Compared with state-of-the-art methods, the proposed algorithm exhibits significantly improved accuracy by avoiding the collapse of temporal networks. Experimental results of a number of artificial and real temporal networks illustrate that the proposed method is not only more accurate but also more robust than state-of-the-art approaches.

Estimating stage-specific daily survival probabilities of nests when nest age is unknown

USGS Publications Warehouse

Stanley, T.R.

2004-01-01

Estimation of daily survival probabilities of nests is common in studies of avian populations. Since the introduction of Mayfield's (1961, 1975) estimator, numerous models have been developed to relax Mayfield's assumptions and account for biologically important sources of variation. Stanley (2000) presented a model for estimating stage-specific (e.g. incubation stage, nestling stage) daily survival probabilities of nests that conditions on “nest type” and requires that nests be aged when they are found. Because aging nests typically requires handling the eggs, there may be situations where nests can not or should not be aged and the Stanley (2000) model will be inapplicable. Here, I present a model for estimating stage-specific daily survival probabilities that conditions on nest stage for active nests, thereby obviating the need to age nests when they are found. Specifically, I derive the maximum likelihood function for the model, evaluate the model's performance using Monte Carlo simulations, and provide software for estimating parameters (along with an example). For sample sizes as low as 50 nests, bias was small and confidence interval coverage was close to the nominal rate, especially when a reduced-parameter model was used for estimation.

Generalized graph states based on Hadamard matrices

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cui, Shawn X.; Yu, Nengkun; Department of Mathematics and Statistics, University of Guelph, Guelph, Ontario N1G 2W1

2015-07-15

Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study themore » entanglement structures of these generalized graph states and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli (X, Z) pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.« less

Phenology of marine turtle nesting revealed by statistical model of the nesting season.

PubMed

Girondot, Marc; Rivalan, Philippe; Wongsopawiro, Ronald; Briane, Jean-Paul; Hulin, Vincent; Caut, Stéphane; Guirlet, Elodie; Godfrey, Matthew H

2006-08-31

Marine turtles deposit their eggs on tropical or subtropical beaches during discrete nesting seasons that span several months. The number and distribution of nests laid during a nesting season provide vital information on various aspects of marine turtle ecology and conservation. In the case of leatherback sea turtles nesting in French Guiana, we developed a mathematical model to explore the phenology of their nesting season, derived from an incomplete nest count dataset. We detected 3 primary components in the nest distribution of leatherbacks: an overall shape that corresponds to the arrival and departure of leatherback females in the Guianas region, a sinusoidal pattern with a period of approximately 10 days that is related to physiological constraints of nesting female leatherbacks, and a sinusoidal pattern with a period of approximately 15 days that likely reflects the influence of spring high tides on nesting female turtles. The model proposed here offers a variety of uses for both marine turtles and also other taxa when individuals are observed in a particular location for only part of the year.

Exploring Graphs: WYSIWYG.

ERIC Educational Resources Information Center

Johnson, Millie

1997-01-01

Graphs from media sources and questions developed from them can be used in the middle school mathematics classroom. Graphs depict storage temperature on a milk carton; air pressure measurements on a package of shock absorbers; sleep-wake patterns of an infant; a dog's breathing patterns; and the angle, velocity, and radius of a leaning bicyclist…

Molecular graph convolutions: moving beyond fingerprints

NASA Astrophysics Data System (ADS)

Kearnes, Steven; McCloskey, Kevin; Berndl, Marc; Pande, Vijay; Riley, Patrick

2016-08-01

Molecular "fingerprints" encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the molecular structure while ignoring others, rather than allowing the model to make data-driven decisions. We describe molecular graph convolutions, a machine learning architecture for learning from undirected graphs, specifically small molecules. Graph convolutions use a simple encoding of the molecular graph—atoms, bonds, distances, etc.—which allows the model to take greater advantage of information in the graph structure. Although graph convolutions do not outperform all fingerprint-based methods, they (along with other graph-based methods) represent a new paradigm in ligand-based virtual screening with exciting opportunities for future improvement.

Nesting behavior of Palila, as assessed from video recordings

USGS Publications Warehouse

Laut, M.E.; Banko, P.C.; Gray, E.M.

2003-01-01

We quantified nesting behavior of Palila (Loxiodes bailleui), an endangered Hawaiian honeycreeper, by recording at nests during three breeding seasons using a black-and-white video camera connected to a Videocassette recorder. A total of seven nests was observed. We measured the following factors for daylight hours: percentage of time the female was on the nest (attendance), length of attendance bouts by the female, length of nest recesses, and adult provisioning rates. Comparisons were made between three stages of the 40-day nesting cycle: incubation (day 1-day 16), early nestling stage (day 17-day 30 [i.e., nestlings ??? 14 days old]), and late nestling stage (day 31-day 40 [i.e., nestlings > 14 days old]). Of seven nests observed, four fledged at least one nestling and three failed. One of these failed nests was filmed being depredated by a feral cat (Felis catus). Female nest attendance was near 82% during the incubation stage and decreased to 21% as nestlings aged. We did not detect a difference in attendance bout length between stages of the nesting cycle. Mean length of nest recesses increased from 4.5 min during the incubation stage to over 45 min during the late nestling stage. Mean number of nest recesses per hour ranged from 1.6 to 2.0. Food was delivered to nestlings by adults an average of 1.8 times per hour for the early nestling stage and 1.5 times per hour during the late nestling stage and did not change over time. Characterization of parental behavior by video had similarities to but also key differences from findings taken from blind observations. Results from this study will facilitate greater understanding of Palila reproductive strategies.

Graph edit distance from spectral seriation.

PubMed

Robles-Kelly, Antonio; Hancock, Edwin R

2005-03-01

This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that they lack some of the formality and rigor of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that string matching techniques can be used. To do this, we use a graph spectral seriation method to convert the adjacency matrix into a string or sequence order. We show how the serial ordering can be established using the leading eigenvector of the graph adjacency matrix. We pose the problem of graph-matching as a maximum a posteriori probability (MAP) alignment of the seriation sequences for pairs of graphs. This treatment leads to an expression in which the edit cost is the negative logarithm of the a posteriori sequence alignment probability. We compute the edit distance by finding the sequence of string edit operations which minimizes the cost of the path traversing the edit lattice. The edit costs are determined by the components of the leading eigenvectors of the adjacency matrix and by the edge densities of the graphs being matched. We demonstrate the utility of the edit distance on a number of graph clustering problems.

Nest substrate reflects incubation style in extant archosaurs with implications for dinosaur nesting habits.

PubMed

Tanaka, Kohei; Zelenitsky, Darla K; Therrien, François; Kobayashi, Yoshitsugu

2018-03-15

Dinosaurs thrived and reproduced in various regions worldwide, including the Arctic. In order to understand their nesting in diverse or extreme environments, the relationships between nests, nesting environments, and incubation methods in extant archosaurs were investigated. Statistical analyses reveal that species of extant covered nesters (i.e., crocodylians and megapodes) preferentially select specific sediments/substrates as a function of their nesting style and incubation heat sources. Relationships between dinosaur eggs and the sediments in which they occur reveal that hadrosaurs and some sauropods (i.e., megaloolithid eggs) built organic-rich mound nests that relied on microbial decay for incubation, whereas other sauropods (i.e., faveoloolithid eggs) built sandy in-filled hole nests that relied on solar or potentially geothermal heat for incubation. Paleogeographic distribution of mound nests and sandy in-filled hole nests in dinosaurs reveals these nest types produced sufficient incubation heat to be successful up to mid latitudes (≤47°), 10° higher than covered nesters today. However, only mound nesting and likely brooding could have produced sufficient incubation heat for nesting above the polar circle (>66°). As a result, differences in nesting styles may have placed restrictions on the reproduction of dinosaurs and their dispersal at high latitudes.

Mining and Indexing Graph Databases

ERIC Educational Resources Information Center

Yuan, Dayu

2013-01-01

Graphs are widely used to model structures and relationships of objects in various scientific and commercial fields. Chemical molecules, proteins, malware system-call dependencies and three-dimensional mechanical parts are all modeled as graphs. In this dissertation, we propose to mine and index those graph data to enable fast and scalable search.…

CyNEST: a maintainable Cython-based interface for the NEST simulator

PubMed Central

Zaytsev, Yury V.; Morrison, Abigail

2014-01-01

NEST is a simulator for large-scale networks of spiking point neuron models (Gewaltig and Diesmann, 2007). Originally, simulations were controlled via the Simulation Language Interpreter (SLI), a built-in scripting facility implementing a language derived from PostScript (Adobe Systems, Inc., 1999). The introduction of PyNEST (Eppler et al., 2008), the Python interface for NEST, enabled users to control simulations using Python. As the majority of NEST users found PyNEST easier to use and to combine with other applications, it immediately displaced SLI as the default NEST interface. However, developing and maintaining PyNEST has become increasingly difficult over time. This is partly because adding new features requires writing low-level C++ code intermixed with calls to the Python/C API, which is unrewarding. Moreover, the Python/C API evolves with each new version of Python, which results in a proliferation of version-dependent code branches. In this contribution we present the re-implementation of PyNEST in the Cython language, a superset of Python that additionally supports the declaration of C/C++ types for variables and class attributes, and provides a convenient foreign function interface (FFI) for invoking C/C++ routines (Behnel et al., 2011). Code generation via Cython allows the production of smaller and more maintainable bindings, including increased compatibility with all supported Python releases without additional burden for NEST developers. Furthermore, this novel approach opens up the possibility to support alternative implementations of the Python language at no cost given a functional Cython back-end for the corresponding implementation, and also enables cross-compilation of Python bindings for embedded systems and supercomputers alike. PMID:24672470

The Antsy Social Network: Determinants of Nest Structure and Arrangement in Asian Weaver Ants.

PubMed

Devarajan, Kadambari

2016-01-01

Asian weaver ants (Oecophylla smaragdina) are arboreal ants that are known to form mutualistic complexes with their host trees. They are eusocial ants that build elaborate nests in the canopy in tropical areas. A colony comprises of multiple nests, usually on multiple trees, and the boundaries of the colony may be difficult to identify. However, they provide the ideal model for studying group living in invertebrates since there are a definite number of nests for a given substrate, the tree. Here, we briefly examine the structure of the nests and the processes involved in the construction and maintenance of these nests. We have described the spatial arrangement of weaver ant nests on trees in two distinct tropical clusters, a few hundred kilometres apart in India. Measurements were made for 13 trees with a total of 71 nests in the two field sites. We have considered a host of biotic and abiotic factors that may be crucial in determining the location of the nesting site by Asian weaver ants. Our results indicate that tree characteristics and architecture followed by leaf features help determine nest location in Asian weaver ants. While environmental factors may not be as influential to nest arrangement, they seem to be important determinants of nest structure. The parameters that may be considered in establishing the nests could be crucial in picking the evolutionary drivers for colonial living in social organisms.

Graphs as a Managerial Tool: A Case Study of Du Pont's Use of Graphs in the Early Twentieth Century.

ERIC Educational Resources Information Center

Yates, JoAnne

1985-01-01

Sketches the development of business graphs in America. Examines their early use at Du Pont and the origin of the chart room around 1920, an important factor in the executive control systems at Du Pont. Draws lessons from this case study for managers and teachers of business communication. (PD)

Path similarity skeleton graph matching.

PubMed

Bai, Xiang; Latecki, Longin Jan

2008-07-01

This paper presents a novel framework to for shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the shortest paths between skeleton endpoints. In contrast to typical tree or graph matching methods, we completely ignore the topological graph structure. Our approach is motivated by the fact that visually similar skeleton graphs may have completely different topological structures. The proposed comparison of shortest paths between endpoints of skeleton graphs yields correct matching results in such cases. The skeletons are pruned by contour partitioning with Discrete Curve Evolution, which implies that the endpoints of skeleton branches correspond to visual parts of the objects. The experimental results demonstrate that our method is able to produce correct results in the presence of articulations, stretching, and occlusion.

Enabling Graph Appliance for Genome Assembly

DOE Office of Scientific and Technical Information (OSTI.GOV)

Singh, Rina; Graves, Jeffrey A; Lee, Sangkeun

2015-01-01

In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to storemore » and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.« less

Nesting Instincts.

ERIC Educational Resources Information Center

Greenman, Geri

2003-01-01

Describes an art project where beginning drawing students used values and chiaroscuro techniques to draw bird nests. Explains how the students observed the nest that was displayed in the art classroom. Discusses the steps involved in creating the artworks. (CMK)

Proving relations between modular graph functions

NASA Astrophysics Data System (ADS)

Basu, Anirban

2016-12-01

We consider modular graph functions that arise in the low energy expansion of the four graviton amplitude in type II string theory. The vertices of these graphs are the positions of insertions of vertex operators on the toroidal worldsheet, while the links are the scalar Green functions connecting the vertices. Graphs with four and five links satisfy several non-trivial relations, which have been proved recently. We prove these relations by using elementary properties of Green functions and the details of the graphs. We also prove a relation between modular graph functions with six links.

Relevance of graph literacy in the development of patient-centered communication tools.

PubMed

Nayak, Jasmir G; Hartzler, Andrea L; Macleod, Liam C; Izard, Jason P; Dalkin, Bruce M; Gore, John L

2016-03-01

To determine the literacy skill sets of patients in the context of graphical interpretation of interactive dashboards. We assessed literacy characteristics of prostate cancer patients and assessed comprehension of quality of life dashboards. Health literacy, numeracy and graph literacy were assessed with validated tools. We divided patients into low vs. high numeracy and graph literacy. We report descriptive statistics on literacy, dashboard comprehension, and relationships between groups. We used correlation and multiple linear regressions to examine factors associated with dashboard comprehension. Despite high health literacy in educated patients (78% college educated), there was variation in numeracy and graph literacy. Numeracy and graph literacy scores were correlated (r=0.37). In those with low literacy, graph literacy scores most strongly correlated with dashboard comprehension (r=0.59-0.90). On multivariate analysis, graph literacy was independently associated with dashboard comprehension, adjusting for age, education, and numeracy level. Even among higher educated patients; variation in the ability to comprehend graphs exists. Clinicians must be aware of these differential proficiencies when counseling patients. Tools for patient-centered communication that employ visual displays need to account for literacy capabilities to ensure that patients can effectively engage these resources. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

Local adjacency metric dimension of sun graph and stacked book graph

NASA Astrophysics Data System (ADS)

Yulisda Badri, Alifiah; Darmaji

2018-03-01

A graph is a mathematical system consisting of a non-empty set of nodes and a set of empty sides. One of the topics to be studied in graph theory is the metric dimension. Application in the metric dimension is the navigation robot system on a path. Robot moves from one vertex to another vertex in the field by minimizing the errors that occur in translating the instructions (code) obtained from the vertices of that location. To move the robot must give different instructions (code). In order for the robot to move efficiently, the robot must be fast to translate the code of the nodes of the location it passes. so that the location vertex has a minimum distance. However, if the robot must move with the vertex location on a very large field, so the robot can not detect because the distance is too far.[6] In this case, the robot can determine its position by utilizing location vertices based on adjacency. The problem is to find the minimum cardinality of the required location vertex, and where to put, so that the robot can determine its location. The solution to this problem is the dimension of adjacency metric and adjacency metric bases. Rodrguez-Velzquez and Fernau combine the adjacency metric dimensions with local metric dimensions, thus becoming the local adjacency metric dimension. In the local adjacency metric dimension each vertex in the graph may have the same adjacency representation as the terms of the vertices. To obtain the local metric dimension of values in the graph of the Sun and the stacked book graph is used the construction method by considering the representation of each adjacent vertex of the graph.

A Note on Hamiltonian Graphs

ERIC Educational Resources Information Center

Skurnick, Ronald; Davi, Charles; Skurnick, Mia

2005-01-01

Since 1952, several well-known graph theorists have proven numerous results regarding Hamiltonian graphs. In fact, many elementary graph theory textbooks contain the theorems of Ore, Bondy and Chvatal, Chvatal and Erdos, Posa, and Dirac, to name a few. In this note, the authors state and prove some propositions of their own concerning Hamiltonian…

Information Graph Flow: A Geometric Approximation of Quantum and Statistical Systems

NASA Astrophysics Data System (ADS)

Vanchurin, Vitaly

2018-05-01

Given a quantum (or statistical) system with a very large number of degrees of freedom and a preferred tensor product factorization of the Hilbert space (or of a space of distributions) we describe how it can be approximated with a very low-dimensional field theory with geometric degrees of freedom. The geometric approximation procedure consists of three steps. The first step is to construct weighted graphs (we call information graphs) with vertices representing subsystems (e.g., qubits or random variables) and edges representing mutual information (or the flow of information) between subsystems. The second step is to deform the adjacency matrices of the information graphs to that of a (locally) low-dimensional lattice using the graph flow equations introduced in the paper. (Note that the graph flow produces very sparse adjacency matrices and thus might also be used, for example, in machine learning or network science where the task of graph sparsification is of a central importance.) The third step is to define an emergent metric and to derive an effective description of the metric and possibly other degrees of freedom. To illustrate the procedure we analyze (numerically and analytically) two information graph flows with geometric attractors (towards locally one- and two-dimensional lattices) and metric perturbations obeying a geometric flow equation. Our analysis also suggests a possible approach to (a non-perturbative) quantum gravity in which the geometry (a secondary object) emerges directly from a quantum state (a primary object) due to the flow of the information graphs.

Information Graph Flow: A Geometric Approximation of Quantum and Statistical Systems

NASA Astrophysics Data System (ADS)

Vanchurin, Vitaly

2018-06-01

Given a quantum (or statistical) system with a very large number of degrees of freedom and a preferred tensor product factorization of the Hilbert space (or of a space of distributions) we describe how it can be approximated with a very low-dimensional field theory with geometric degrees of freedom. The geometric approximation procedure consists of three steps. The first step is to construct weighted graphs (we call information graphs) with vertices representing subsystems (e.g., qubits or random variables) and edges representing mutual information (or the flow of information) between subsystems. The second step is to deform the adjacency matrices of the information graphs to that of a (locally) low-dimensional lattice using the graph flow equations introduced in the paper. (Note that the graph flow produces very sparse adjacency matrices and thus might also be used, for example, in machine learning or network science where the task of graph sparsification is of a central importance.) The third step is to define an emergent metric and to derive an effective description of the metric and possibly other degrees of freedom. To illustrate the procedure we analyze (numerically and analytically) two information graph flows with geometric attractors (towards locally one- and two-dimensional lattices) and metric perturbations obeying a geometric flow equation. Our analysis also suggests a possible approach to (a non-perturbative) quantum gravity in which the geometry (a secondary object) emerges directly from a quantum state (a primary object) due to the flow of the information graphs.

Molecular graph convolutions: moving beyond fingerprints

PubMed Central

Kearnes, Steven; McCloskey, Kevin; Berndl, Marc; Pande, Vijay; Riley, Patrick

2016-01-01

Molecular “fingerprints” encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the molecular structure while ignoring others, rather than allowing the model to make data-driven decisions. We describe molecular graph convolutions, a machine learning architecture for learning from undirected graphs, specifically small molecules. Graph convolutions use a simple encoding of the molecular graph—atoms, bonds, distances, etc.—which allows the model to take greater advantage of information in the graph structure. Although graph convolutions do not outperform all fingerprint-based methods, they (along with other graph-based methods) represent a new paradigm in ligand-based virtual screening with exciting opportunities for future improvement. PMID:27558503

Changing nest placement of Hawaiian Common Amakihi during the breeding cycle

USGS Publications Warehouse

van Riper, Charles; Kern, M. D.; Sogge, M. K.

1993-01-01

We studied the nesting behavior of the Common Amakihi (Hemignathus virens) from 1970-1981 on the island of Hawaii to determine if the species alters nest placement over a protracted 9-month breeding season. Birds preferentially chose the southwest quadrant of trees in which to build nests during all phases of the breeding season. It appeared that ambient temperature (Ta) was a contributing factor to differential nest placement between early and late phases of the annual breeding cycle. When Ta is low during the early (December-March) breeding period, Common Amakihi selected exposed nesting locations that benefitted them with maximum solar insolation. However, in the later phase of the breeding period (April-July) when Ta was much higher, renesting birds selected nest sites deeper in the canopy in significantly taller trees. This is one of the few documented examples in which a species changes location of nest during a breeding season, thus allowing exploitation of temporally differing microclimatic conditions.

SING: Subgraph search In Non-homogeneous Graphs

PubMed Central

2010-01-01

Background Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image understanding. Since subgraph isomorphism is a computationally hard problem, indexing techniques have been intensively exploited to speed up the process. Such systems filter out those graphs which cannot contain the query, and apply a subgraph isomorphism algorithm to each residual candidate graph. The applicability of such systems is limited to databases of small graphs, because their filtering power degrades on large graphs. Results In this paper, SING (Subgraph search In Non-homogeneous Graphs), a novel indexing system able to cope with large graphs, is presented. The method uses the notion of feature, which can be a small subgraph, subtree or path. Each graph in the database is annotated with the set of all its features. The key point is to make use of feature locality information. This idea is used to both improve the filtering performance and speed up the subgraph isomorphism task. Conclusions Extensive tests on chemical compounds, biological networks and synthetic graphs show that the proposed system outperforms the most popular systems in query time over databases of medium and large graphs. Other specific tests show that the proposed system is effective for single large graphs. PMID:20170516

Cavity Nesting Birds

Treesearch

Virgil E. Scott; Keith E. Evans; David R. Patton; Charles P. Stone

1977-01-01

Many species of cavity-nesting birds have declined because of habitat reduction. In the eastern United States, where primeval forests are gone, purple martins depend almost entirely on man-made nesting structures (Allen and Nice 1952). The hole-nesting population of peregrine falcons disappeared with the felling of the giant trees upon which they depended (Hickey and...

Analyzing cross-college course enrollments via contextual graph mining

PubMed Central

Liu, Xiaozhong; Chen, Yan

2017-01-01

The ability to predict what courses a student may enroll in the coming semester plays a pivotal role in the allocation of learning resources, which is a hot topic in the domain of educational data mining. In this study, we propose an innovative approach to characterize students’ cross-college course enrollments by leveraging a novel contextual graph. Specifically, different kinds of variables, such as students, courses, colleges and diplomas, as well as various types of variable relations, are utilized to depict the context of each variable, and then a representation learning algorithm node2vec is applied to extracting sophisticated graph-based features for the enrollment analysis. In this manner, the relations between any pair of variables can be measured quantitatively, which enables the variable type to transform from nominal to ratio. These graph-based features are examined by the random forest algorithm, and experiments on 24,663 students, 1,674 courses and 417,590 enrollment records demonstrate that the contextual graph can successfully improve analyzing the cross-college course enrollments, where three of the graph-based features have significantly stronger impacts on prediction accuracy than the others. Besides, the empirical results also indicate that the student’s course preference is the most important factor in predicting future course enrollments, which is consistent to the previous studies that acknowledge the course interest is a key point for course recommendations. PMID:29186171

Analyzing cross-college course enrollments via contextual graph mining.

PubMed

Wang, Yongzhen; Liu, Xiaozhong; Chen, Yan

2017-01-01

The ability to predict what courses a student may enroll in the coming semester plays a pivotal role in the allocation of learning resources, which is a hot topic in the domain of educational data mining. In this study, we propose an innovative approach to characterize students' cross-college course enrollments by leveraging a novel contextual graph. Specifically, different kinds of variables, such as students, courses, colleges and diplomas, as well as various types of variable relations, are utilized to depict the context of each variable, and then a representation learning algorithm node2vec is applied to extracting sophisticated graph-based features for the enrollment analysis. In this manner, the relations between any pair of variables can be measured quantitatively, which enables the variable type to transform from nominal to ratio. These graph-based features are examined by the random forest algorithm, and experiments on 24,663 students, 1,674 courses and 417,590 enrollment records demonstrate that the contextual graph can successfully improve analyzing the cross-college course enrollments, where three of the graph-based features have significantly stronger impacts on prediction accuracy than the others. Besides, the empirical results also indicate that the student's course preference is the most important factor in predicting future course enrollments, which is consistent to the previous studies that acknowledge the course interest is a key point for course recommendations.

Nest predators of open and cavity nesting birds in oak woodlands

Treesearch

Kathryn L. Purcell; Jared Verner

1999-01-01

Camera setups revealed at least three species of rodents and seven species of birds as potential predators at artificial open nests. Surprisingly, among avian predators identified at open nests, one third were Bullock's Orioles (Icterus bullockii). Two rodent species and three bird species were potential predators at artificial cavity nests. This high predator...

Chapter 6: Characteristics of Marbled Murrelet Nest Trees and Nesting Stands

Treesearch

Thomas E. Hamer; S. Kim Nelson

1995-01-01

We summarize the characteristics of 61 tree nests and nesting stands of the Marbled Murrelet ( Brachyramphus marmoratus ) located from 1974 to 1993 in Alaska, British Columbia, Washington, Oregon, and California. Evidence of breeding 30-60 km inland was common in California, Oregon, and Washington. Nesting greater distances from the coast may have...

Recursive Feature Extraction in Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

2014-08-14

ReFeX extracts recursive topological features from graph data. The input is a graph as a csv file and the output is a csv file containing feature values for each node in the graph. The features are based on topological counts in the neighborhoods of each nodes, as well as recursive summaries of neighbors' features.

Output-Sensitive Construction of Reeb Graphs.

PubMed

Doraiswamy, H; Natarajan, V

2012-01-01

The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds or non-manifolds in any dimension. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Critical points correspond to nodes in the Reeb graph. Arcs connecting the nodes are computed in the second step by a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The paper also describes a scheme for controlled simplification of the Reeb graph and two different graph layout schemes that help in the effective presentation of Reeb graphs for visual analysis of scalar fields. Finally, the Reeb graph is employed in four different applications-surface segmentation, spatially-aware transfer function design, visualization of interval volumes, and interactive exploration of time-varying data.

Modeling nest survival of cavity-nesting birds in relation to postfire salvage logging

Treesearch

Vicki Saab; Robin E. Russell; Jay Rotella; Jonathan G. Dudley

2011-01-01

Salvage logging practices in recently burned forests often have direct effects on species associated with dead trees, particularly cavity-nesting birds. As such, evaluation of postfire management practices on nest survival rates of cavity nesters is necessary for determining conservation strategies. We monitored 1,797 nests of 6 cavity-nesting bird species: Lewis'...

Multigraph: Reusable Interactive Data Graphs

NASA Astrophysics Data System (ADS)

Phillips, M. B.

2010-12-01

There are surprisingly few good software tools available for presenting time series data on the internet. The most common practice is to use a desktop program such as Excel or Matlab to save a graph as an image which can be included in a web page like any other image. This disconnects the graph from the data in a way that makes updating a graph with new data a cumbersome manual process, and it limits the user to one particular view of the data. The Multigraph project defines an XML format for describing interactive data graphs, and software tools for creating and rendering those graphs in web pages and other internet connected applications. Viewing a Multigraph graph is extremely simple and intuitive, and requires no instructions; the user can pan and zoom by clicking and dragging, in a familiar "Google Maps" kind of way. Creating a new graph for inclusion in a web page involves writing a simple XML configuration file. Multigraph can read data in a variety of formats, and can display data from a web service, allowing users to "surf" through large data sets, downloading only those the parts of the data that are needed for display. The Multigraph XML format, or "MUGL" for short, provides a concise description of the visual properties of a graph, such as axes, plot styles, data sources, labels, etc, as well as interactivity properties such as how and whether the user can pan or zoom along each axis. Multigraph reads a file in this format, draws the described graph, and allows the user to interact with it. Multigraph software currently includes a Flash application for embedding graphs in web pages, a Flex component for embedding graphs in larger Flex/Flash applications, and a plugin for creating graphs in the WordPress content management system. Plans for the future include a Java version for desktop viewing and editing, a command line version for batch and server side rendering, and possibly Android and iPhone versions. Multigraph is currently in use on several web

The One Universal Graph — a free and open graph database

NASA Astrophysics Data System (ADS)

Ng, Liang S.; Champion, Corbin

2016-02-01

Recent developments in graph database mostly are huge projects involving big organizations, big operations and big capital, as the name Big Data attests. We proposed the concept of One Universal Graph (OUG) which states that all observable and known objects and concepts (physical, conceptual or digitally represented) can be connected with only one single graph; furthermore the OUG can be implemented with a very simple text file format with free software, capable of being executed on Android or smaller devices. As such the One Universal Graph Data Exchange (GOUDEX) modules can potentially be installed on hundreds of millions of Android devices and Intel compatible computers shipped annually. Coupled with its open nature and ability to connect to existing leading search engines and databases currently in operation, GOUDEX has the potential to become the largest and a better interface for users and programmers to interact with the data on the Internet. With a Web User Interface for users to use and program in native Linux environment, Free Crowdware implemented in GOUDEX can help inexperienced users learn programming with better organized documentation for free software, and is able to manage programmer's contribution down to a single line of code or a single variable in software projects. It can become the first practically realizable “Internet brain” on which a global artificial intelligence system can be implemented. Being practically free and open, One Universal Graph can have significant applications in robotics, artificial intelligence as well as social networks.

Triangular Nests!

ERIC Educational Resources Information Center

Powell, R. I.

2002-01-01

Shows how integer-sided triangles can be nested, each nest having a single enclosing isosceles triangle. Brings to light what can be seen as a relatively simple generalization of Pythagoras' theorem, a result that should be readily accessible to many secondary school pupils. (Author/KHR)

Semantic graphs and associative memories

NASA Astrophysics Data System (ADS)

Pomi, Andrés; Mizraji, Eduardo

2004-12-01

Graphs have been increasingly utilized in the characterization of complex networks from diverse origins, including different kinds of semantic networks. Human memories are associative and are known to support complex semantic nets; these nets are represented by graphs. However, it is not known how the brain can sustain these semantic graphs. The vision of cognitive brain activities, shown by modern functional imaging techniques, assigns renewed value to classical distributed associative memory models. Here we show that these neural network models, also known as correlation matrix memories, naturally support a graph representation of the stored semantic structure. We demonstrate that the adjacency matrix of this graph of associations is just the memory coded with the standard basis of the concept vector space, and that the spectrum of the graph is a code invariant of the memory. As long as the assumptions of the model remain valid this result provides a practical method to predict and modify the evolution of the cognitive dynamics. Also, it could provide us with a way to comprehend how individual brains that map the external reality, almost surely with different particular vector representations, are nevertheless able to communicate and share a common knowledge of the world. We finish presenting adaptive association graphs, an extension of the model that makes use of the tensor product, which provides a solution to the known problem of branching in semantic nets.

RNA Graph Partitioning for the Discovery of RNA Modularity: A Novel Application of Graph Partition Algorithm to Biology

PubMed Central

Elmetwaly, Shereef; Schlick, Tamar

2014-01-01

Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in structural biology, structures of molecules can be described, including RNA structures. In our RNA-As-Graphs (RAG) framework, we represent RNA structures as tree graphs by translating unpaired regions into vertices and helices into edges. Here we explore the modularity of RNA structures by applying graph partitioning known in graph theory to divide an RNA graph into subgraphs. To our knowledge, this is the first application of graph partitioning to biology, and the results suggest a systematic approach for modular design in general. The graph partitioning algorithms utilize mathematical properties of the Laplacian eigenvector (µ2) corresponding to the second eigenvalues (λ2) associated with the topology matrix defining the graph: λ2 describes the overall topology, and the sum of µ2′s components is zero. The three types of algorithms, termed median, sign, and gap cuts, divide a graph by determining nodes of cut by median, zero, and largest gap of µ2′s components, respectively. We apply these algorithms to 45 graphs corresponding to all solved RNA structures up through 11 vertices (∼220 nucleotides). While we observe that the median cut divides a graph into two similar-sized subgraphs, the sign and gap cuts partition a graph into two topologically-distinct subgraphs. We find that the gap cut produces the best biologically-relevant partitioning for RNA because it divides RNAs at less stable connections while maintaining junctions intact. The iterative gap cuts suggest basic modules and assembly protocols to design large RNA structures. Our graph substructuring thus suggests a systematic approach to explore the modularity of biological networks. In our applications to RNA structures, subgraphs also suggest

Computing Information Value from RDF Graph Properties

DOE Office of Scientific and Technical Information (OSTI.GOV)

al-Saffar, Sinan; Heileman, Gregory

2010-11-08

Information value has been implicitly utilized and mostly non-subjectively computed in information retrieval (IR) systems. We explicitly define and compute the value of an information piece as a function of two parameters, the first is the potential semantic impact the target information can subjectively have on its recipient's world-knowledge, and the second parameter is trust in the information source. We model these two parameters as properties of RDF graphs. Two graphs are constructed, a target graph representing the semantics of the target body of information and a context graph representing the context of the consumer of that information. We computemore » information value subjectively as a function of both potential change to the context graph (impact) and the overlap between the two graphs (trust). Graph change is computed as a graph edit distance measuring the dissimilarity between the context graph before and after the learning of the target graph. A particular application of this subjective information valuation is in the construction of a personalized ranking component in Web search engines. Based on our method, we construct a Web re-ranking system that personalizes the information experience for the information-consumer.« less

Kevin Bacon and Graph Theory

ERIC Educational Resources Information Center

Hopkins, Brian

2004-01-01

The interconnected world of actors and movies is a familiar, rich example for graph theory. This paper gives the history of the "Kevin Bacon Game" and makes extensive use of a Web site to analyze the underlying graph. The main content is the classroom development of the weighted average to determine the best choice of "center" for the graph. The…

Cavity-nesting bird use of nest boxes in vineyards of central-coast California

Treesearch

Daniel P. Mummert; Laura Baines; William D. Tietje

2002-01-01

Oak woodland habitat is being degraded or replaced by vineyards in many areas of central-coastal California. Oak woodlands are home to many insectivorous, cavity-nesting birds that would be beneficial in and around vineyards. During March to June 2001, we used bluebird nest boxes to study nest box use and productivity of cavity-nesting birds in vineyards versus...

Age and breeding success related to nest position in a White stork Ciconia ciconia colony

NASA Astrophysics Data System (ADS)

Vergara, Pablo; Aguirre, José I.

2006-11-01

Coloniality is a breeding system that may produce benefits in terms of breeding success, although these advantages could vary according to factors such as colony size or nest position. We studied breeder's age in relation to nest position (peripheral or central) within the colony. In addition, we studied the relationship between breeding success and nest position, controlling for breeder's age, a highly correlated factor, in a White Stork Ciconia ciconia colony over a 7-year period. Our results show that central nests are mainly occupied by adult birds and had lower failure rates. However, controlling for breeder's age, nest position per se did not explain breeding success. The scarce predation and the lack of human disturbance in the study colony could explain the absence of differences in breeding success between different nest positions within the colony.

CUDA Enabled Graph Subset Examiner

DOE Office of Scientific and Technical Information (OSTI.GOV)

Johnston, Jeremy T.

2016-12-22

Finding Godsil-McKay switching sets in graphs is one way to demonstrate that a specific graph is not determined by its spectrum--the eigenvalues of its adjacency matrix. An important area of active research in pure mathematics is determining which graphs are determined by their spectra, i.e. when the spectrum of the adjacency matrix uniquely determines the underlying graph. We are interested in exploring the spectra of graphs in the Johnson scheme and specifically seek to determine which of these graphs are determined by their spectra. Given a graph G, a Godsil-McKay switching set is an induced subgraph H on 2k verticesmore » with the following properties: I) H is regular, ii) every vertex in G/H is adjacent to either 0, k, or 2k vertices of H, and iii) at least one vertex in G/H is adjacent to k vertices in H. The software package examines each subset of a user specified size to determine whether or not it satisfies those 3 conditions. The software makes use of the massive parallel processing power of CUDA enabled GPUs. It also exploits the vertex transitivity of graphs in the Johnson scheme by reasoning that if G has a Godsil-McKay switching set, then it has a switching set which includes vertex 1. While the code (in its current state) is tuned to this specific problem, the method of examining each induced subgraph of G can be easily re-written to check for any user specified conditions on the subgraphs and can therefore be used much more broadly.« less

Multi-A Graph Patrolling and Partitioning

NASA Astrophysics Data System (ADS)

Elor, Y.; Bruckstein, A. M.

2012-12-01

We introduce a novel multi agent patrolling algorithm inspired by the behavior of gas filled balloons. Very low capability ant-like agents are considered with the task of patrolling an unknown area modeled as a graph. While executing the proposed algorithm, the agents dynamically partition the graph between them using simple local interactions, every agent assuming the responsibility for patrolling his subgraph. Balanced graph partition is an emergent behavior due to the local interactions between the agents in the swarm. Extensive simulations on various graphs (environments) showed that the average time to reach a balanced partition is linear with the graph size. The simulations yielded a convincing argument for conjecturing that if the graph being patrolled contains a balanced partition, the agents will find it. However, we could not prove this. Nevertheless, we have proved that if a balanced partition is reached, the maximum time lag between two successive visits to any vertex using the proposed strategy is at most twice the optimal so the patrol quality is at least half the optimal. In case of weighted graphs the patrol quality is at least (1)/(2){lmin}/{lmax} of the optimal where lmax (lmin) is the longest (shortest) edge in the graph.

Sketch Matching on Topology Product Graph.

PubMed

Liang, Shuang; Luo, Jun; Liu, Wenyin; Wei, Yichen

2015-08-01

Sketch matching is the fundamental problem in sketch based interfaces. After years of study, it remains challenging when there exists large irregularity and variations in the hand drawn sketch shapes. While most existing works exploit topology relations and graph representations for this problem, they are usually limited by the coarse topology exploration and heuristic (thus suboptimal) similarity metrics between graphs. We present a new sketch matching method with two novel contributions. We introduce a comprehensive definition of topology relations, which results in a rich and informative graph representation of sketches. For graph matching, we propose topology product graph that retains the full correspondence for matching two graphs. Based on it, we derive an intuitive sketch similarity metric whose exact solution is easy to compute. In addition, the graph representation and new metric naturally support partial matching, an important practical problem that received less attention in the literature. Extensive experimental results on a real challenging dataset and the superior performance of our method show that it outperforms the state-of-the-art.

From neurons to nests: nest-building behaviour as a model in behavioural and comparative neuroscience.

PubMed

Hall, Zachary J; Meddle, Simone L; Healy, Susan D

Despite centuries of observing the nest building of most extant bird species, we know surprisingly little about how birds build nests and, specifically, how the avian brain controls nest building. Here, we argue that nest building in birds may be a useful model behaviour in which to study how the brain controls behaviour. Specifically, we argue that nest building as a behavioural model provides a unique opportunity to study not only the mechanisms through which the brain controls behaviour within individuals of a single species but also how evolution may have shaped the brain to produce interspecific variation in nest-building behaviour. In this review, we outline the questions in both behavioural and comparative neuroscience that nest building could be used to address, summarize recent findings regarding the neurobiology of nest building in lab-reared zebra finches and across species building different nest structures, and suggest some future directions for the neurobiology of nest building.

Avoiding the nest : responses of field sparrows to the threat of nest predation

Treesearch

Dirk E. Burhans

2000-01-01

Nest predation is a major source of reproductive failure in birds (Ricklefs 1969, Martin 1992). Birds confronted with an enemy near the nest may use behaviors to deter the prospect of nest predation. The benefits of nest defense have been shown for many agressive species (Martin 1992), but smaller birds that cannot deter predators may need to resort to other behaviors...

Nestly--a framework for running software with nested parameter choices and aggregating results.

PubMed

McCoy, Connor O; Gallagher, Aaron; Hoffman, Noah G; Matsen, Frederick A

2013-02-01

The execution of a software application or pipeline using various combinations of parameters and inputs is a common task in bioinformatics. In the absence of a specialized tool to organize, streamline and formalize this process, scientists must write frequently complex scripts to perform these tasks. We present nestly, a Python package to facilitate running tools with nested combinations of parameters and inputs. nestly provides three components. First, a module to build nested directory structures corresponding to choices of parameters. Second, the nestrun script to run a given command using each set of parameter choices. Third, the nestagg script to aggregate results of the individual runs into a CSV file, as well as support for more complex aggregation. We also include a module for easily specifying nested dependencies for the SCons build tool, enabling incremental builds. Source, documentation and tutorial examples are available at http://github.com/fhcrc/nestly. nestly can be installed from the Python Package Index via pip; it is open source (MIT license).

Relating zeta functions of discrete and quantum graphs

NASA Astrophysics Data System (ADS)

Harrison, Jonathan; Weyand, Tracy

2018-02-01

We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation between the spectrum of the Laplacian on a discrete graph and that of the Laplacian on an equilateral metric graph. As a by-product, we determine how the multiplicity of eigenvalues of the quantum graph, that are also in the spectrum of the graph with Dirichlet conditions at the vertices, depends on the graph geometry. Finally we apply the result to calculate the vacuum energy and spectral determinant of a complete bipartite graph and compare our results with those for a star graph, a graph in which all vertices are connected to a central vertex by a single edge.

Local Higher-Order Graph Clustering

PubMed Central

Yin, Hao; Benson, Austin R.; Leskovec, Jure; Gleich, David F.

2018-01-01

Local graph clustering methods aim to find a cluster of nodes by exploring a small region of the graph. These methods are attractive because they enable targeted clustering around a given seed node and are faster than traditional global graph clustering methods because their runtime does not depend on the size of the input graph. However, current local graph partitioning methods are not designed to account for the higher-order structures crucial to the network, nor can they effectively handle directed networks. Here we introduce a new class of local graph clustering methods that address these issues by incorporating higher-order network information captured by small subgraphs, also called network motifs. We develop the Motif-based Approximate Personalized PageRank (MAPPR) algorithm that finds clusters containing a seed node with minimal motif conductance, a generalization of the conductance metric for network motifs. We generalize existing theory to prove the fast running time (independent of the size of the graph) and obtain theoretical guarantees on the cluster quality (in terms of motif conductance). We also develop a theory of node neighborhoods for finding sets that have small motif conductance, and apply these results to the case of finding good seed nodes to use as input to the MAPPR algorithm. Experimental validation on community detection tasks in both synthetic and real-world networks, shows that our new framework MAPPR outperforms the current edge-based personalized PageRank methodology. PMID:29770258

Aspects of Performance on Line Graph Description Tasks: Influenced by Graph Familiarity and Different Task Features

ERIC Educational Resources Information Center

Xi, Xiaoming

2010-01-01

Motivated by cognitive theories of graph comprehension, this study systematically manipulated characteristics of a line graph description task in a speaking test in ways to mitigate the influence of graph familiarity, a potential source of construct-irrelevant variance. It extends Xi (2005), which found that the differences in holistic scores on…

Continuous-time quantum walks on star graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Salimi, S.

2009-06-15

In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N-fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K{sub 2} graphs (complete graph with two vertices) and the probability of observing walk tends to the uniform distribution.

Nest site characteristics, nesting movements, and lack of long-term nest site fidelity in Agassiz's desert tortoises at a wind energy facility in southern California

USGS Publications Warehouse

Lovich, Jeffrey E.; Agha, Mickey; Yackulic, Charles B.; Meyer-Wilkins, Kathie; Bjurlin, Curtis; Ennen, Joshua R.; Arundel, Terry R.; Austin, Meaghan

2014-01-01

Nest site selection has important consequences for maternal and offspring survival and fitness. Females of some species return to the same nesting areas year after year. We studied nest site characteristics, fidelity, and daily pre-nesting movements in a population of Agassiz’s desert tortoises (Gopherus agassizii) at a wind energy facility in southern California during two field seasons separated by over a decade. No females returned to the same exact nest site within or between years but several nested in the same general area. However, distances between first and second clutches within a year (2000) were not significantly different from distances between nests among years (2000 and 2011) for a small sample of females, suggesting some degree of fidelity within their normal activity areas. Environmental attributes of nest sites did not differ significantly among females but did among years due largely to changes in perennial plant structure as a result of multiple fires. Daily pre-nesting distances moved by females decreased consistently from the time shelled eggs were first visible in X-radiographs until oviposition, again suggesting some degree of nest site selection. Tortoises appear to select nest sites that are within their long-term activity areas, inside the climate-moderated confines of one of their self-constructed burrows, and specifically, at a depth in the burrow that minimizes exposure of eggs and embryos to lethal incubation temperatures. Nesting in “climate-controlled” burrows and nest guarding by females relaxes some of the constraints that drive nest site selection in other oviparous species.

RATGRAPH: Computer Graphing of Rational Functions.

ERIC Educational Resources Information Center

Minch, Bradley A.

1987-01-01

Presents an easy-to-use Applesoft BASIC program that graphs rational functions and any asymptotes that the functions might have. Discusses the nature of rational functions, graphing them manually, employing a computer to graph rational functions, and describes how the program works. (TW)

The graph neural network model.

PubMed

Scarselli, Franco; Gori, Marco; Tsoi, Ah Chung; Hagenbuchner, Markus; Monfardini, Gabriele

2009-01-01

Many underlying relationships among data in several areas of science and engineering, e.g., computer vision, molecular chemistry, molecular biology, pattern recognition, and data mining, can be represented in terms of graphs. In this paper, we propose a new neural network model, called graph neural network (GNN) model, that extends existing neural network methods for processing the data represented in graph domains. This GNN model, which can directly process most of the practically useful types of graphs, e.g., acyclic, cyclic, directed, and undirected, implements a function tau(G,n) is an element of IR(m) that maps a graph G and one of its nodes n into an m-dimensional Euclidean space. A supervised learning algorithm is derived to estimate the parameters of the proposed GNN model. The computational cost of the proposed algorithm is also considered. Some experimental results are shown to validate the proposed learning algorithm, and to demonstrate its generalization capabilities.

VISAGE: Interactive Visual Graph Querying.

PubMed

Pienta, Robert; Navathe, Shamkant; Tamersoy, Acar; Tong, Hanghang; Endert, Alex; Chau, Duen Horng

2016-06-01

Extracting useful patterns from large network datasets has become a fundamental challenge in many domains. We present VISAGE, an interactive visual graph querying approach that empowers users to construct expressive queries, without writing complex code (e.g., finding money laundering rings of bankers and business owners). Our contributions are as follows: (1) we introduce graph autocomplete , an interactive approach that guides users to construct and refine queries, preventing over-specification; (2) VISAGE guides the construction of graph queries using a data-driven approach, enabling users to specify queries with varying levels of specificity, from concrete and detailed (e.g., query by example), to abstract (e.g., with "wildcard" nodes of any types), to purely structural matching; (3) a twelve-participant, within-subject user study demonstrates VISAGE's ease of use and the ability to construct graph queries significantly faster than using a conventional query language; (4) VISAGE works on real graphs with over 468K edges, achieving sub-second response times for common queries.

VISAGE: Interactive Visual Graph Querying

PubMed Central

Pienta, Robert; Navathe, Shamkant; Tamersoy, Acar; Tong, Hanghang; Endert, Alex; Chau, Duen Horng

2017-01-01

Extracting useful patterns from large network datasets has become a fundamental challenge in many domains. We present VISAGE, an interactive visual graph querying approach that empowers users to construct expressive queries, without writing complex code (e.g., finding money laundering rings of bankers and business owners). Our contributions are as follows: (1) we introduce graph autocomplete, an interactive approach that guides users to construct and refine queries, preventing over-specification; (2) VISAGE guides the construction of graph queries using a data-driven approach, enabling users to specify queries with varying levels of specificity, from concrete and detailed (e.g., query by example), to abstract (e.g., with “wildcard” nodes of any types), to purely structural matching; (3) a twelve-participant, within-subject user study demonstrates VISAGE’s ease of use and the ability to construct graph queries significantly faster than using a conventional query language; (4) VISAGE works on real graphs with over 468K edges, achieving sub-second response times for common queries. PMID:28553670

Bipartite separability and nonlocal quantum operations on graphs

NASA Astrophysics Data System (ADS)

Dutta, Supriyo; Adhikari, Bibhas; Banerjee, Subhashish; Srikanth, R.

2016-07-01

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension m ×n arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

Annotation Graphs: A Graph-Based Visualization for Meta-Analysis of Data Based on User-Authored Annotations.

PubMed

Zhao, Jian; Glueck, Michael; Breslav, Simon; Chevalier, Fanny; Khan, Azam

2017-01-01

User-authored annotations of data can support analysts in the activity of hypothesis generation and sensemaking, where it is not only critical to document key observations, but also to communicate insights between analysts. We present annotation graphs, a dynamic graph visualization that enables meta-analysis of data based on user-authored annotations. The annotation graph topology encodes annotation semantics, which describe the content of and relations between data selections, comments, and tags. We present a mixed-initiative approach to graph layout that integrates an analyst's manual manipulations with an automatic method based on similarity inferred from the annotation semantics. Various visual graph layout styles reveal different perspectives on the annotation semantics. Annotation graphs are implemented within C8, a system that supports authoring annotations during exploratory analysis of a dataset. We apply principles of Exploratory Sequential Data Analysis (ESDA) in designing C8, and further link these to an existing task typology in the visualization literature. We develop and evaluate the system through an iterative user-centered design process with three experts, situated in the domain of analyzing HCI experiment data. The results suggest that annotation graphs are effective as a method of visually extending user-authored annotations to data meta-analysis for discovery and organization of ideas.

Nest site attributes and temporal patterns of northern flicker nest loss: effects of predation and competition.

PubMed

Fisher, Ryan J; Wiebe, Karen L

2006-04-01

To date, most studies of nest site selection have failed to take into account more than one source of nest loss (or have combined all sources in one analysis) when examining nest site characteristics, leaving us with an incomplete understanding of the potential trade-offs that individuals may face when selecting a nest site. Our objectives were to determine whether northern flickers (Colaptes auratus) may experience a trade-off in nest site selection in response to mammalian nest predation and nest loss to a cavity nest competitor (European starling, Sturnus vulgaris). We also document within-season temporal patterns of these two sources of nest loss with the hypothesis that flickers may also be constrained in the timing of reproduction under both predatory and competitive influence. Mammalian predators frequently depredated flicker nests that were: lower to the ground, less concealed by vegetation around the cavity entrance and at the base of the nest tree, closer to coniferous forest edges and in forest clumps with a high percentage of conifer content. Proximity to coniferous edges or coniferous trees increased the probability of nest predation, but nests near conifers were less likely to be lost to starlings. Flickers may thus face a trade-off in nest site selection with respect to safety from predators or competitors. Models suggested that peaks of nest predation and nest loss to eviction occurred at the same time, although a competing model suggested that the peak of nest loss to starlings occurred 5 days earlier than the peak of mammalian predation. Differences in peaks of mammalian predation and loss to starlings may constrain any adjustment in clutch initiation date by flickers to avoid one source of nest loss.

Eggs in the Freezer: Energetic Consequences of Nest Site and Nest Design in Arctic Breeding Shorebirds

PubMed Central

Tulp, Ingrid; Schekkerman, Hans; de Leeuw, Joep

2012-01-01

Birds construct nests for several reasons. For species that breed in the Arctic, the insulative properties of nests are very important. Incubation is costly there and due to an increasing surface to volume ratio, more so in smaller species. Small species are therefore more likely to place their nests in thermally favourable microhabitats and/or to invest more in nest insulation than large species. To test this hypothesis, we examined characteristics of nests of six Arctic breeding shorebird species. All species chose thermally favourable nesting sites in a higher proportion than expected on the basis of habitat availability. Site choice did not differ between species. Depth to frozen ground, measured near the nests, decreased in the course of the season at similar non-species-specific speeds, but this depth increased with species size. Nest cup depth and nest scrape depth (nest cup without the lining) were unrelated to body mass (we applied an exponent of 0.73, to account for metabolic activity of the differently sized species). Cup depth divided by diameter2 was used as a measure of nest cup shape. Small species had narrow and deep nests, while large species had wide shallow nests. The thickness of nest lining varied between 0.1 cm and 7.6 cm, and decreased significantly with body mass. We reconstruct the combined effect of different nest properties on the egg cooling coefficient using previously published quantitative relationships. The predicted effect of nest cup depth and lining depth on heat loss to the frozen ground did not correlate with body mass, but the sheltering effect of nest cup diameter against wind and the effects of lining material on the cooling coefficient increased with body mass. Our results suggest that small arctic shorebirds invest more in the insulation of their nests than large species. PMID:22701596

Timing of nest vegetation measurement may obscure adaptive significance of nest-site characteristics: A simulation study.

PubMed

McConnell, Mark D; Monroe, Adrian P; Burger, Loren Wes; Martin, James A

2017-02-01

Advances in understanding avian nesting ecology are hindered by a prevalent lack of agreement between nest-site characteristics and fitness metrics such as nest success. We posit this is a result of inconsistent and improper timing of nest-site vegetation measurements. Therefore, we evaluated how the timing of nest vegetation measurement influences the estimated effects of vegetation structure on nest survival. We simulated phenological changes in nest-site vegetation growth over a typical nesting season and modeled how the timing of measuring that vegetation, relative to nest fate, creates bias in conclusions regarding its influence on nest survival. We modeled the bias associated with four methods of measuring nest-site vegetation: Method 1-measuring at nest initiation, Method 2-measuring at nest termination regardless of fate, Method 3-measuring at nest termination for successful nests and at estimated completion for unsuccessful nests, and Method 4-measuring at nest termination regardless of fate while also accounting for initiation date. We quantified and compared bias for each method for varying simulated effects, ranked models for each method using AIC, and calculated the proportion of simulations in which each model (measurement method) was selected as the best model. Our results indicate that the risk of drawing an erroneous or spurious conclusion was present in all methods but greater with Method 2 which is the most common method reported in the literature. Methods 1 and 3 were similarly less biased. Method 4 provided no additional value as bias was similar to Method 2 for all scenarios. While Method 1 is seldom practical to collect in the field, Method 3 is logistically practical and minimizes inherent bias. Implementation of Method 3 will facilitate estimating the effect of nest-site vegetation on survival, in the least biased way, and allow reliable conclusions to be drawn.

Variation in nesting behavior of eight species of spider mites, Stigmaeopsis having sociality

NASA Astrophysics Data System (ADS)

Saito, Yutaka; Zhang, Yan-Xuan; Mori, Kotaro; Ito, Katsura; Sato, Yukie; Chittenden, Anthony R.; Lin, Jian-Zhen; Chae, Younghae; Sakagami, Takane; Sahara, Ken

2016-10-01

Nesting behavior is considered to be an important element of social living in animals. The spider mites belonging to the genus Stigmaeopsis spend their lives within nests produced from silk threads. Several of these species show cooperative sociality, while the others are subsocial. In order to identify the origins of this social behavior, comparisons of nest sizes, nesting behaviors (making nests continuously or separately), and their associated traits (fecal deposition patterns) were made for eight cogeneric Stigmaeopsis species showing various levels of social development. All of these species inhabit bamboo plants (Poaceae). We initially addressed the proximate factor of nest size variation. The variation in nest size of the eight species corresponded well with the variation in dorsal seta sc1 length, suggesting that nest size variation among species may have a genetic basis. The time spent within a nest (nest duration) increased with nest size on the respective host plants. Nest arrangement patterns varied among species showing different sized nests: Large nest builders continuously extended their nests, while middle and small nest-building species built new separate nests, which resulted in different social interaction times among species, and is thought to be closely related to social development. Fecal deposition behaviors also varied among Stigmaeopsis species, suggesting diversity in anti-predatory adaptations. Finally, we discuss how the variation in sociality observed within this genus is likely the result of nest size variation that initially evolved as anti-predator strategies.

Variation in nesting behavior of eight species of spider mites, Stigmaeopsis having sociality.

PubMed

Saito, Yutaka; Zhang, Yan-Xuan; Mori, Kotaro; Ito, Katsura; Sato, Yukie; Chittenden, Anthony R; Lin, Jian-Zhen; Chae, Younghae; Sakagami, Takane; Sahara, Ken

2016-10-01

Nesting behavior is considered to be an important element of social living in animals. The spider mites belonging to the genus Stigmaeopsis spend their lives within nests produced from silk threads. Several of these species show cooperative sociality, while the others are subsocial. In order to identify the origins of this social behavior, comparisons of nest sizes, nesting behaviors (making nests continuously or separately), and their associated traits (fecal deposition patterns) were made for eight cogeneric Stigmaeopsis species showing various levels of social development. All of these species inhabit bamboo plants (Poaceae). We initially addressed the proximate factor of nest size variation. The variation in nest size of the eight species corresponded well with the variation in dorsal seta sc1 length, suggesting that nest size variation among species may have a genetic basis. The time spent within a nest (nest duration) increased with nest size on the respective host plants. Nest arrangement patterns varied among species showing different sized nests: Large nest builders continuously extended their nests, while middle and small nest-building species built new separate nests, which resulted in different social interaction times among species, and is thought to be closely related to social development. Fecal deposition behaviors also varied among Stigmaeopsis species, suggesting diversity in anti-predatory adaptations. Finally, we discuss how the variation in sociality observed within this genus is likely the result of nest size variation that initially evolved as anti-predator strategies.

Graph processing platforms at scale: practices and experiences

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lim, Seung-Hwan; Lee, Sangkeun; Brown, Tyler C

2015-01-01

Graph analysis unveils hidden associations of data in many phenomena and artifacts, such as road network, social networks, genomic information, and scientific collaboration. Unfortunately, a wide diversity in the characteristics of graphs and graph operations make it challenging to find a right combination of tools and implementation of algorithms to discover desired knowledge from the target data set. This study presents an extensive empirical study of three representative graph processing platforms: Pegasus, GraphX, and Urika. Each system represents a combination of options in data model, processing paradigm, and infrastructure. We benchmarked each platform using three popular graph operations, degree distribution,more » connected components, and PageRank over a variety of real-world graphs. Our experiments show that each graph processing platform shows different strength, depending the type of graph operations. While Urika performs the best in non-iterative operations like degree distribution, GraphX outputforms iterative operations like connected components and PageRank. In addition, we discuss challenges to optimize the performance of each platform over large scale real world graphs.« less

Effects of invasive woody plants on avian nest site selection and nesting success in shrublands

Treesearch

S. Schlossberg; D.I. King

2010-01-01

Exotic, invasive plants are a growing conservation problem. Birds frequently use invasive plants as nest substrates, but effects of invasives on avian nesting success have been equivocal in past studies. In 2004 and 2005, we assessed effects of invasive woody plants on avian nest-site selection and nesting success in western Massachusetts shrublands. At the nest scale...

Sandhill crane abundance and nesting ecology at Grays Lake, Idaho

USGS Publications Warehouse

Austin, J.E.; Henry, A.R.; Ball, I.J.

2007-01-01

We examined population size and factors influencing nest survival of greater sandhill cranes (Grus canadensis tabida) at Grays Lake National Wildlife Refuge, Idaho, USA, during 1997-2000. Average local population of cranes from late April to early May, 1998-2000, was 735 cranes, 34% higher than that reported for May 1970-1971. We estimated 228 (SE = 30) nests in the basin core (excluding renests), 14% higher than a 1971 estimate. Apparent nest success in our study (x?? = 60%, n = 519 nests) was lower than reported for Grays Lake 30-50 years earlier. Daily survival rates (DSRs) of all nests averaged 0.9707 (41.2%). The best model explaining nest survival included year and water depth and their interaction. Nest survival was highest (DSR = 0.9827) in 1998 compared with other years (0.9698-0.9707). Nest survival changed little relative to water depth in 1998, when flooding was extensive and alternative prey (microtines) irrupted, but declined markedly with lower water levels in 2000, the driest year studied. Hypotheses relating nest survival to vegetation height, land use (idle, summer grazing, fall grazing), and date were not supported. In a before-after-control-impact design using 12 experimental fields, nest survival differed among years but not among management treatments (idle, fall graze, fall burn, and summer-graze-idle rotation), nor was there an interaction between year and treatments. However, DSRs in fall-burn fields declined from 0.9781 in 1997-1998 to 0.9503 in 1999-2000 (posttreatment). Changes in the predator community have likely contributed to declines in nest success since the 1950s and 1970s. Our results did not support earlier concerns about effects of habitat management practices on crane productivity. Nest survival could best be enhanced by managing spring water levels. Managers should continue censuses during late April to evaluate long-term relationships to habitat conditions and management.

Nest marking behavior and chemical composition of olfactory cues involved in nest recognition in Megachile rotundata.

PubMed

Guédot, Christelle; Buckner, James S; Hagen, Marcia M; Bosch, Jordi; Kemp, William P; Pitts-Singer, Theresa L

2013-08-01

In-nest observations of the solitary bee, Megachile rotundata (F.), revealed that nesting females apply olfactory cues to nests for nest recognition. On their way in and out of the nest, females drag the abdomen along the entire length of the nest, and sometimes deposit fluid droplets from the tip of the abdomen. The removal of bee-marked sections of the nest resulted in hesitation and searching behavior by females, indicating the loss of olfactory cues used for nest recognition. Chemical analysis of female cuticles and the deposits inside marked nesting tubes revealed the presence of hydrocarbons, wax esters, fatty aldehydes, and fatty alcohol acetate esters. Chemical compositions were similar across tube samples, but proportionally different from cuticular extracts. These findings reveal the importance of lipids as chemical signals for nest recognition and suggest that the nest-marking cues are derived from a source in addition to, or other than, the female cuticle.

Survey of Approaches to Generate Realistic Synthetic Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lim, Seung-Hwan; Lee, Sangkeun; Powers, Sarah S

A graph is a flexible data structure that can represent relationships between entities. As with other data analysis tasks, the use of realistic graphs is critical to obtaining valid research results. Unfortunately, using the actual ("real-world") graphs for research and new algorithm development is difficult due to the presence of sensitive information in the data or due to the scale of data. This results in practitioners developing algorithms and systems that employ synthetic graphs instead of real-world graphs. Generating realistic synthetic graphs that provide reliable statistical confidence to algorithmic analysis and system evaluation involves addressing technical hurdles in a broadmore » set of areas. This report surveys the state of the art in approaches to generate realistic graphs that are derived from fitted graph models on real-world graphs.« less

Constructing Dense Graphs with Unique Hamiltonian Cycles

ERIC Educational Resources Information Center

Lynch, Mark A. M.

2012-01-01

It is not difficult to construct dense graphs containing Hamiltonian cycles, but it is difficult to generate dense graphs that are guaranteed to contain a unique Hamiltonian cycle. This article presents an algorithm for generating arbitrarily large simple graphs containing "unique" Hamiltonian cycles. These graphs can be turned into dense graphs…

The Replicator Equation on Graphs

PubMed Central

Ohtsuki, Hisashi; Nowak, Martin A.

2008-01-01

We study evolutionary games on graphs. Each player is represented by a vertex of the graph. The edges denote who meets whom. A player can use any one of n strategies. Players obtain a payoff from interaction with all their immediate neighbors. We consider three different update rules, called ‘birth-death’, ‘death-birth’ and ‘imitation’. A fourth update rule, ‘pairwise comparison’, is shown to be equivalent to birth-death updating in our model. We use pair-approximation to describe the evolutionary game dynamics on regular graphs of degree k. In the limit of weak selection, we can derive a differential equation which describes how the average frequency of each strategy on the graph changes over time. Remarkably, this equation is a replicator equation with a transformed payoff matrix. Therefore, moving a game from a well-mixed population (the complete graph) onto a regular graph simply results in a transformation of the payoff matrix. The new payoff matrix is the sum of the original payoff matrix plus another matrix, which describes the local competition of strategies. We discuss the application of our theory to four particular examples, the Prisoner’s Dilemma, the Snow-Drift game, a coordination game and the Rock-Scissors-Paper game. PMID:16860343

On some labelings of triangular snake and central graph of triangular snake graph

NASA Astrophysics Data System (ADS)

Agasthi, P.; Parvathi, N.

2018-04-01

A Triangular snake Tn is obtained from a path u 1 u 2 … u n by joining ui and u i+1 to a new vertex wi for 1≤i≤n‑1. A Central graph of Triangular snake C(T n ) is obtained by subdividing each edge of Tn exactly once and joining all the non adjacent vertices of Tn . In this paper the ways to construct square sum, square difference, Root Mean square, strongly Multiplicative, Even Mean and Odd Mean labeling for Triangular Snake and Central graph of Triangular Snake graphs are reported.

Extracting Loop Bounds for WCET Analysis Using the Instrumentation Point Graph

NASA Astrophysics Data System (ADS)

Betts, A.; Bernat, G.

2009-05-01

Every calculation engine proposed in the literature of Worst-Case Execution Time (WCET) analysis requires upper bounds on loop iterations. Existing mechanisms to procure this information are either error prone, because they are gathered from the end-user, or limited in scope, because automatic analyses target very specific loop structures. In this paper, we present a technique that obtains bounds completely automatically for arbitrary loop structures. In particular, we show how to employ the Instrumentation Point Graph (IPG) to parse traces of execution (generated by an instrumented program) in order to extract bounds relative to any loop-nesting level. With this technique, therefore, non-rectangular dependencies between loops can be captured, allowing more accurate WCET estimates to be calculated. We demonstrate the improvement in accuracy by comparing WCET estimates computed through our HMB framework against those computed with state-of-the-art techniques.

Graph Frequency Analysis of Brain Signals

PubMed Central

Huang, Weiyu; Goldsberry, Leah; Wymbs, Nicholas F.; Grafton, Scott T.; Bassett, Danielle S.; Ribeiro, Alejandro

2016-01-01

This paper presents methods to analyze functional brain networks and signals from graph spectral perspectives. The notion of frequency and filters traditionally defined for signals supported on regular domains such as discrete time and image grids has been recently generalized to irregular graph domains, and defines brain graph frequencies associated with different levels of spatial smoothness across the brain regions. Brain network frequency also enables the decomposition of brain signals into pieces corresponding to smooth or rapid variations. We relate graph frequency with principal component analysis when the networks of interest denote functional connectivity. The methods are utilized to analyze brain networks and signals as subjects master a simple motor skill. We observe that brain signals corresponding to different graph frequencies exhibit different levels of adaptability throughout learning. Further, we notice a strong association between graph spectral properties of brain networks and the level of exposure to tasks performed, and recognize the most contributing and important frequency signatures at different levels of task familiarity. PMID:28439325

A comparison of diel nest temperature and nest site selection for two sympatric species of freshwater turtles

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bodie, J.R.; Burke, V.J.; Smith, K.R.

1996-07-01

Diel nest temperature profiles were recorded form natural nests of eastern mud turtles (Kinosternon subrubrum) and Florida cooters (Pseudemys floridana) to determine whether nest microhabitat selection compensates for the effect of interspecific differences in nest depth on nest temperature. Kinosternon subrubrum nest depths were significantly shallower than those of P. floridana (t = 2.93, P < 0.01). We predicted that differences in nest depth would result in K. subrubrum nests being cooler at night and warmer during daylight than the deeper P. floridana nests. Diel temperature patterns agreed with out predictions at night, but P. floridana nest temperatures were notmore » lower than K. subrubrum nest temperatures during the day. Soil composition, slope and soil moisture were similar for the nest of both species. However, the amount of sunlight reaching the soil above K. subrubrum nest sites was substantially less than the amount above P. floridana nest sites. We suggest that these species select habitats for oviposition that differ in the amount and types of vegetative cover, which in turn affect exposure to sunlight and ultimately nest temperature. 27 refs., 2 figs.« less

[Structure characteristics of natural nests and its implication to artificial nest frame design for Ciconia boyciana].

PubMed

Wei, Yi-qing; Cui, Guo-fa

2014-12-01

Artificial nest can improve the breeding success of birds in the field, and it has been proved to be more effective to endangered species. We surveyed the structure characteristics of natural nest and the status of the use of artificial nests for oriental white stork, Ciconia boyciana, in Honghe National Nature Reserve, Heilongjiang Province. Differences were investigated among the structure characteristics of the used and unused artificial nests, and natural nests based on one-way ANOVA. It was observed that significant differences in the diameter of nest branch, the vertical an- gle between nest branch, the height of the jointthe height of the nest above ground exited in different nest types. On account of the structure characteristics of the natural nests of C. boyciana, the suitable diameter of nest pillar for artificial nest frame should be 15.0-25.0 cm with the height of 5.0-12.0 m, which would be better if they were constructed by some acid-resistant materials, e.g., cement. The number of nest stands should be 3-4 individuals with the diameter of 9.0-12.0 cm, the vertical angle of 45 degrees-60 degrees, and the length of 90.0-140.0 cm.

Nest success of snowy plovers (Charadrius nivosus) in the Southern high plains of Texas

USGS Publications Warehouse

Saalfeld, S.T.; Conway, Warren C.; Haukos, D.A.; Johnson, W.P.

2011-01-01

Snowy Plovers (Charadrius nivosus) nesting on edges of saline lakes within the Southern High Plains (SHP) of Texas are threatened by habitat degradation due to reduced artesian spring flow, making many saline lakes unsuitable for nesting and migrating shorebirds. Factors influencing nest success were evaluated, current nest success estimates in the SHP of Texas were compared to estimates obtained ten years prior, and causes and timing of nest failures determined. Overall, 215 nests were monitored from three saline lakes in 20082009, with nest success estimates from Program MARK ranging from 7-33% ( x??= 22%). The leading causes of nest failures were attributed to predation (40%) and weather (36%). Nest success was negatively influenced by number of plants within 707-cm 2 plot, positively influenced by percent surface water availability, and at one saline lake, negatively influenced by day during the nesting season (i.e., nest success declined later in the nesting season). When compared to estimates ten years prior (19981999), mean nest success has declined by 31%. If nesting Snowy Plovers continue to experience increased predation rates, decreased hydrological integrity, and habitat alterations, populations will continue to decline throughout this region.

Linking snake behavior to nest predation in a Midwestern bird community.

PubMed

Weatherhead, Patrick J; Carfagno, Gerardo L F; Sperry, Jinelle H; Brawn, Jeffrey D; Robinson, Scott K

2010-01-01

Nest predators can adversely affect the viability of songbird populations, and their impact is exacerbated in fragmented habitats. Despite substantial research on this predator-prey interaction, however, almost all of the focus has been on the birds rather than their nest predators, thereby limiting our understanding of the factors that bring predators and nests into contact. We used radiotelemetry to document the activity of two snake species (rat snakes, Elaphe obsoleta; racers, Coluber constrictor) known to prey on nests in Midwestern bird communities and simultaneously monitored 300 songbird nests and tested the hypothesis that predation risk should increase for nests when snakes were more active and in edge habitat preferred by both snake species. Predation risk increased when rat snakes were more active, for all nests combined and for two of the six bird species for which we had sufficient nests to allow separate analyses. This result is consistent with rat snakes being more important nest predators than racers. We found no evidence, however, that nests closer to forest edges were at greater risk. These results are generally consistent with the one previous study that investigated rat snakes and nest predation simultaneously. The seemingly paradoxical failure to find higher predation risk in the snakes' preferred habitat (i.e., edge) might be explained by the snakes using edges at least in part for non-foraging activities. We propose that higher nest predation in fragmented habitats (at least that attributable to snakes) results indirectly from edges promoting larger snake populations, rather than from edges directly increasing the risk of nest predation by snakes. If so, the notion of edges per se functioning as ecological "traps" merits further study.

My Bar Graph Tells a Story

ERIC Educational Resources Information Center

McMillen, Sue; McMillen, Beth

2010-01-01

Connecting stories to qualitative coordinate graphs has been suggested as an effective instructional strategy. Even students who are able to "create" bar graphs may struggle to correctly "interpret" them. Giving children opportunities to work with qualitative graphs can help them develop the skills to interpret, describe, and compare information…

Graph reconstruction using covariance-based methods.

PubMed

Sulaimanov, Nurgazy; Koeppl, Heinz

2016-12-01

Methods based on correlation and partial correlation are today employed in the reconstruction of a statistical interaction graph from high-throughput omics data. These dedicated methods work well even for the case when the number of variables exceeds the number of samples. In this study, we investigate how the graphs extracted from covariance and concentration matrix estimates are related by using Neumann series and transitive closure and through discussing concrete small examples. Considering the ideal case where the true graph is available, we also compare correlation and partial correlation methods for large realistic graphs. In particular, we perform the comparisons with optimally selected parameters based on the true underlying graph and with data-driven approaches where the parameters are directly estimated from the data.

OPEX: Optimized Eccentricity Computation in Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Henderson, Keith

2011-11-14

Real-world graphs have many properties of interest, but often these properties are expensive to compute. We focus on eccentricity, radius and diameter in this work. These properties are useful measures of the global connectivity patterns in a graph. Unfortunately, computing eccentricity for all nodes is O(n2) for a graph with n nodes. We present OPEX, a novel combination of optimizations which improves computation time of these properties by orders of magnitude in real-world experiments on graphs of many different sizes. We run OPEX on graphs with up to millions of links. OPEX gives either exact results or bounded approximations, unlikemore » its competitors which give probabilistic approximations or sacrifice node-level information (eccentricity) to compute graphlevel information (diameter).« less

Genome alignment with graph data structures: a comparison

PubMed Central

2014-01-01

Background Recent advances in rapid, low-cost sequencing have opened up the opportunity to study complete genome sequences. The computational approach of multiple genome alignment allows investigation of evolutionarily related genomes in an integrated fashion, providing a basis for downstream analyses such as rearrangement studies and phylogenetic inference. Graphs have proven to be a powerful tool for coping with the complexity of genome-scale sequence alignments. The potential of graphs to intuitively represent all aspects of genome alignments led to the development of graph-based approaches for genome alignment. These approaches construct a graph from a set of local alignments, and derive a genome alignment through identification and removal of graph substructures that indicate errors in the alignment. Results We compare the structures of commonly used graphs in terms of their abilities to represent alignment information. We describe how the graphs can be transformed into each other, and identify and classify graph substructures common to one or more graphs. Based on previous approaches, we compile a list of modifications that remove these substructures. Conclusion We show that crucial pieces of alignment information, associated with inversions and duplications, are not visible in the structure of all graphs. If we neglect vertex or edge labels, the graphs differ in their information content. Still, many ideas are shared among all graph-based approaches. Based on these findings, we outline a conceptual framework for graph-based genome alignment that can assist in the development of future genome alignment tools. PMID:24712884

So Many Graphs, So Little Time

ERIC Educational Resources Information Center

Wall, Jennifer J.; Benson, Christine C.

2009-01-01

Interpreting graphs found in various content areas is an important skill for students, especially in light of high-stakes testing. In addition, reading and understanding graphs is an important part of numeracy, or numeric literacy, a skill necessary for informed citizenry. This article explores the different categories of graphs, provides…

Ground-nesting by the chimpanzees of the Nimba Mountains, Guinea: environmentally or socially determined?

PubMed

Koops, Kathelijne; Humle, Tatyana; Sterck, Elisabeth H M; Matsuzawa, Tetsuro

2007-04-01

The chimpanzees (Pan troglodytes verus) of the Nimba Mountains, Guinea, West Africa, commonly make both elaborate ("night") and simple ("day") nests on the ground. In this study we investigated which factors might influence ground-nesting in this population, and tested two ecological hypotheses: 1) climatic conditions, such as high wind speeds at high altitudes, may deter chimpanzees from nesting in trees; and 2) a lack of appropriate arboreal nesting opportunities may drive the chimpanzees to nest on the ground. In addition to testing these two hypotheses, we explored whether ground-nesting is a sex-linked behavior. Data were collected monthly between August 2003 and May 2004 along transects and ad libitum. To identify the sex of ground-nesting individuals, we used DNA extracted from hair samples. The results showed that the occurrence and distribution of ground nests were not affected by climatic conditions or a lack of appropriate nest trees. Support was found for the notion that ground-nesting is a sex-linked behavior, as males were responsible for building all of the elaborate ground nests and most of the simple ground nests sampled. Elaborate ground nests occurred mostly in nest groups associated with tree nests, whereas simple ground nests usually occurred without tree nests in their vicinity. These results suggest that ground-nesting may be socially, rather than ecologically, determined.

Sharp-Tailed Grouse Nest Survival and Nest Predator Habitat Use in North Dakota's Bakken Oil Field.

PubMed

Burr, Paul C; Robinson, Aaron C; Larsen, Randy T; Newman, Robert A; Ellis-Felege, Susan N

2017-01-01

Recent advancements in extraction technologies have resulted in rapid increases of gas and oil development across the United States and specifically in western North Dakota. This expansion of energy development has unknown influences on local wildlife populations and the ecological interactions within and among species. Our objectives for this study were to evaluate nest success and nest predator dynamics of sharp-tailed grouse (Tympanuchus phasianellus) in two study sites that represented areas of high and low energy development intensities in North Dakota. During the summers of 2012 and 2013, we monitored 163 grouse nests using radio telemetry. Of these, 90 nests also were monitored using miniature cameras to accurately determine nest fates and identify nest predators. We simultaneously conducted predator surveys using camera scent stations and occupancy modeling to estimate nest predator occurrence at each site. American badgers (Taxidea taxus) and striped skunks (Mephitis mephitis) were the primary nest predators, accounting for 56.7% of all video recorded nest depredations. Nests in our high intensity gas and oil area were 1.95 times more likely to succeed compared to our minimal intensity area. Camera monitored nests were 2.03 times more likely to succeed than non-camera monitored nests. Occupancy of mammalian nest predators was 6.9 times more likely in our study area of minimal gas and oil intensity compared to the high intensity area. Although only a correlative study, our results suggest energy development may alter the predator community, thereby increasing nest success for sharp-tailed grouse in areas of intense development, while adjacent areas may have increased predator occurrence and reduced nest success. Our study illustrates the potential influences of energy development on the nest predator-prey dynamics of sharp-tailed grouse in western North Dakota and the complexity of evaluating such impacts on wildlife.

Real World Graph Connectivity

ERIC Educational Resources Information Center

Lind, Joy; Narayan, Darren

2009-01-01

We present the topic of graph connectivity along with a famous theorem of Menger in the real-world setting of the national computer network infrastructure of "National LambdaRail". We include a set of exercises where students reinforce their understanding of graph connectivity by analysing the "National LambdaRail" network. Finally, we give…

Discriminative graph embedding for label propagation.

PubMed

Nguyen, Canh Hao; Mamitsuka, Hiroshi

2011-09-01

In many applications, the available information is encoded in graph structures. This is a common problem in biological networks, social networks, web communities and document citations. We investigate the problem of classifying nodes' labels on a similarity graph given only a graph structure on the nodes. Conventional machine learning methods usually require data to reside in some Euclidean spaces or to have a kernel representation. Applying these methods to nodes on graphs would require embedding the graphs into these spaces. By embedding and then learning the nodes on graphs, most methods are either flexible with different learning objectives or efficient enough for large scale applications. We propose a method to embed a graph into a feature space for a discriminative purpose. Our idea is to include label information into the embedding process, making the space representation tailored to the task. We design embedding objective functions that the following learning formulations become spectral transforms. We then reformulate these spectral transforms into multiple kernel learning problems. Our method, while being tailored to the discriminative tasks, is efficient and can scale to massive data sets. We show the need of discriminative embedding on some simulations. Applying to biological network problems, our method is shown to outperform baselines.

47 CFR 80.761 - Conversion graphs.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 5 2010-10-01 2010-10-01 false Conversion graphs. 80.761 Section 80.761... MARITIME SERVICES Standards for Computing Public Coast Station VHF Coverage § 80.761 Conversion graphs. The following graphs must be employed where conversion from one to the other of the indicated types of units is...

47 CFR 80.761 - Conversion graphs.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 5 2011-10-01 2011-10-01 false Conversion graphs. 80.761 Section 80.761... MARITIME SERVICES Standards for Computing Public Coast Station VHF Coverage § 80.761 Conversion graphs. The following graphs must be employed where conversion from one to the other of the indicated types of units is...

Selection of arboreal termitaria for nesting by cooperatively breeding Micronesian Kingfishers Todiramphus cinnamominus reichenbachii

USGS Publications Warehouse

Kesler, Dylan C.; Haig, Susan M.

2005-01-01

Limited nest-site availability appears to be an important factor in the evolution of delayed dispersal and cooperative breeding in some cavity-nesting species. The cooperatively breeding Pohnpei subspecies of Micronesian Kingfisher Todiramphus cinnamominus reichenbachii excavates nest cavities from the nests of arboreal termites Nasutitermes spp., or termitaria. In this first published description of nest-sites for this subspecies, we used surveys, remote sensing and radiotelemetry to evaluate the relationship between nest-site availability and co-operation. Results illustrate that nest termitaria are higher in the forest canopy, larger in volume and occur in areas with more contiguous canopy cover than unused termitaria. Nest termitaria were selected independently of the proximity to forest edges and territory boundaries, and we found no difference in characteristics of termitaria used by cooperative groups and breeding pairs. Logistic regression modelling indicated that termitaria with nest-like characteristics were not limited in abundance, suggesting that neither the prospects of inheriting nesting resources nor limited nest-site abundance are probable explanations for delayed dispersal in the Pohnpei subspecies of Micronesian Kingfisher.

Building Scalable Knowledge Graphs for Earth Science

NASA Technical Reports Server (NTRS)

Ramachandran, Rahul; Maskey, Manil; Gatlin, Patrick; Zhang, Jia; Duan, Xiaoyi; Miller, J. J.; Bugbee, Kaylin; Christopher, Sundar; Freitag, Brian

2017-01-01

Knowledge Graphs link key entities in a specific domain with other entities via relationships. From these relationships, researchers can query knowledge graphs for probabilistic recommendations to infer new knowledge. Scientific papers are an untapped resource which knowledge graphs could leverage to accelerate research discovery. Goal: Develop an end-to-end (semi) automated methodology for constructing Knowledge Graphs for Earth Science.

A hierarchical nest survival model integrating incomplete temporally varying covariates

PubMed Central

Converse, Sarah J; Royle, J Andrew; Adler, Peter H; Urbanek, Richard P; Barzen, Jeb A

2013-01-01

Nest success is a critical determinant of the dynamics of avian populations, and nest survival modeling has played a key role in advancing avian ecology and management. Beginning with the development of daily nest survival models, and proceeding through subsequent extensions, the capacity for modeling the effects of hypothesized factors on nest survival has expanded greatly. We extend nest survival models further by introducing an approach to deal with incompletely observed, temporally varying covariates using a hierarchical model. Hierarchical modeling offers a way to separate process and observational components of demographic models to obtain estimates of the parameters of primary interest, and to evaluate structural effects of ecological and management interest. We built a hierarchical model for daily nest survival to analyze nest data from reintroduced whooping cranes (Grus americana) in the Eastern Migratory Population. This reintroduction effort has been beset by poor reproduction, apparently due primarily to nest abandonment by breeding birds. We used the model to assess support for the hypothesis that nest abandonment is caused by harassment from biting insects. We obtained indices of blood-feeding insect populations based on the spatially interpolated counts of insects captured in carbon dioxide traps. However, insect trapping was not conducted daily, and so we had incomplete information on a temporally variable covariate of interest. We therefore supplemented our nest survival model with a parallel model for estimating the values of the missing insect covariates. We used Bayesian model selection to identify the best predictors of daily nest survival. Our results suggest that the black fly Simulium annulus may be negatively affecting nest survival of reintroduced whooping cranes, with decreasing nest survival as abundance of S. annulus increases. The modeling framework we have developed will be applied in the future to a larger data set to evaluate the

A hierarchical nest survival model integrating incomplete temporally varying covariates

USGS Publications Warehouse

Converse, Sarah J.; Royle, J. Andrew; Adler, Peter H.; Urbanek, Richard P.; Barzan, Jeb A.

2013-01-01

Nest success is a critical determinant of the dynamics of avian populations, and nest survival modeling has played a key role in advancing avian ecology and management. Beginning with the development of daily nest survival models, and proceeding through subsequent extensions, the capacity for modeling the effects of hypothesized factors on nest survival has expanded greatly. We extend nest survival models further by introducing an approach to deal with incompletely observed, temporally varying covariates using a hierarchical model. Hierarchical modeling offers a way to separate process and observational components of demographic models to obtain estimates of the parameters of primary interest, and to evaluate structural effects of ecological and management interest. We built a hierarchical model for daily nest survival to analyze nest data from reintroduced whooping cranes (Grus americana) in the Eastern Migratory Population. This reintroduction effort has been beset by poor reproduction, apparently due primarily to nest abandonment by breeding birds. We used the model to assess support for the hypothesis that nest abandonment is caused by harassment from biting insects. We obtained indices of blood-feeding insect populations based on the spatially interpolated counts of insects captured in carbon dioxide traps. However, insect trapping was not conducted daily, and so we had incomplete information on a temporally variable covariate of interest. We therefore supplemented our nest survival model with a parallel model for estimating the values of the missing insect covariates. We used Bayesian model selection to identify the best predictors of daily nest survival. Our results suggest that the black fly Simulium annulus may be negatively affecting nest survival of reintroduced whooping cranes, with decreasing nest survival as abundance of S. annulus increases. The modeling framework we have developed will be applied in the future to a larger data set to evaluate the

GrouseFlocks: steerable exploration of graph hierarchy space.

PubMed

Archambault, Daniel; Munzner, Tamara; Auber, David

2008-01-01

Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorithms or topological features present in the graph. However, many graphs have domain-specific attributes associated with the nodes and edges, which could be used to create many possible hierarchies providing unique views of the input graph. GrouseFlocks is a system for the exploration of this graph hierarchy space. By allowing users to see several different possible hierarchies on the same graph, the system helps users investigate graph hierarchy space instead of a single fixed hierarchy. GrouseFlocks provides a simple set of operations so that users can create and modify their graph hierarchies based on selections. These selections can be made manually or based on patterns in the attribute data provided with the graph. It provides feedback to the user within seconds, allowing interactive exploration of this space.

graphkernels: R and Python packages for graph comparison

PubMed Central

Ghisu, M Elisabetta; Llinares-López, Felipe; Borgwardt, Karsten

2018-01-01

Abstract Summary Measuring the similarity of graphs is a fundamental step in the analysis of graph-structured data, which is omnipresent in computational biology. Graph kernels have been proposed as a powerful and efficient approach to this problem of graph comparison. Here we provide graphkernels, the first R and Python graph kernel libraries including baseline kernels such as label histogram based kernels, classic graph kernels such as random walk based kernels, and the state-of-the-art Weisfeiler-Lehman graph kernel. The core of all graph kernels is implemented in C ++ for efficiency. Using the kernel matrices computed by the package, we can easily perform tasks such as classification, regression and clustering on graph-structured samples. Availability and implementation The R and Python packages including source code are available at https://CRAN.R-project.org/package=graphkernels and https://pypi.python.org/pypi/graphkernels. Contact mahito@nii.ac.jp or elisabetta.ghisu@bsse.ethz.ch Supplementary information Supplementary data are available online at Bioinformatics. PMID:29028902

graphkernels: R and Python packages for graph comparison.

PubMed

Sugiyama, Mahito; Ghisu, M Elisabetta; Llinares-López, Felipe; Borgwardt, Karsten

2018-02-01

Measuring the similarity of graphs is a fundamental step in the analysis of graph-structured data, which is omnipresent in computational biology. Graph kernels have been proposed as a powerful and efficient approach to this problem of graph comparison. Here we provide graphkernels, the first R and Python graph kernel libraries including baseline kernels such as label histogram based kernels, classic graph kernels such as random walk based kernels, and the state-of-the-art Weisfeiler-Lehman graph kernel. The core of all graph kernels is implemented in C ++ for efficiency. Using the kernel matrices computed by the package, we can easily perform tasks such as classification, regression and clustering on graph-structured samples. The R and Python packages including source code are available at https://CRAN.R-project.org/package=graphkernels and https://pypi.python.org/pypi/graphkernels. mahito@nii.ac.jp or elisabetta.ghisu@bsse.ethz.ch. Supplementary data are available online at Bioinformatics. © The Author(s) 2017. Published by Oxford University Press.

On a programming language for graph algorithms

NASA Technical Reports Server (NTRS)

Rheinboldt, W. C.; Basili, V. R.; Mesztenyi, C. K.

1971-01-01

An algorithmic language, GRAAL, is presented for describing and implementing graph algorithms of the type primarily arising in applications. The language is based on a set algebraic model of graph theory which defines the graph structure in terms of morphisms between certain set algebraic structures over the node set and arc set. GRAAL is modular in the sense that the user specifies which of these mappings are available with any graph. This allows flexibility in the selection of the storage representation for different graph structures. In line with its set theoretic foundation, the language introduces sets as a basic data type and provides for the efficient execution of all set and graph operators. At present, GRAAL is defined as an extension of ALGOL 60 (revised) and its formal description is given as a supplement to the syntactic and semantic definition of ALGOL. Several typical graph algorithms are written in GRAAL to illustrate various features of the language and to show its applicability.

Graphs and Zero-Divisors

ERIC Educational Resources Information Center

Axtell, M.; Stickles, J.

2010-01-01

The last ten years have seen an explosion of research in the zero-divisor graphs of commutative rings--by professional mathematicians "and" undergraduates. The objective is to find algebraic information within the geometry of these graphs. This topic is approachable by anyone with one or two semesters of abstract algebra. This article gives the…

Are randomly grown graphs really random?

PubMed

Callaway, D S; Hopcroft, J E; Kleinberg, J M; Newman, M E; Strogatz, S H

2001-10-01

We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time steps. In the limit of large t, the resulting graph displays surprisingly rich characteristics. In particular, a giant component emerges in an infinite-order phase transition at delta=1/8. At the transition, the average component size jumps discontinuously but remains finite. In contrast, a static random graph with the same degree distribution exhibits a second-order phase transition at delta=1/4, and the average component size diverges there. These dramatic differences between grown and static random graphs stem from a positive correlation between the degrees of connected vertices in the grown graph-older vertices tend to have higher degree, and to link with other high-degree vertices, merely by virtue of their age. We conclude that grown graphs, however randomly they are constructed, are fundamentally different from their static random graph counterparts.

Nest ectoparasites increase physiological stress in breeding birds: an experiment.

PubMed

Martínez-de la Puente, Josué; Merino, Santiago; Tomás, Gustavo; Moreno, Juan; Morales, Judith; Lobato, Elisa; Martínez, Javier

2011-02-01

Parasites are undoubtedly a biotic factor that produces stress. Heat shock proteins (HSPs) are important molecules buffering cellular damage under adverse conditions. During the breeding season, blue tit Cyanistes caeruleus (L.) adults are affected by blood parasites, nest-dwelling parasites and biting flies, potentially affecting their HSP-mediated responses. Here, we treated females with primaquine to reduce blood parasites and fumigated nests with permethrin to reduce nest-dwelling parasites to test whether these treatments affect HSP60 level during the breeding season. Medicated females, but not controls, had a significant reduction of the intensity of infection by Haemoproteus spp. blood parasites. However, final intensity of infection did not differ significantly between groups, and we did not find an effect of medication on change in HSP60 level. Fumigation reduced the abundance of nest-dwelling parasites (mites, fleas and blowfly larvae) and engorged biting midges in nests. Females breeding in non-fumigated nests increased HSP60 levels during the season more than those breeding in fumigated nests. Furthermore, the change in HSP60 level was positively correlated with the abundance of biting midges. These results show how infections by nest ectoparasites during the breeding period can increase the level of HSPs and suggest that biting midges impose physiological costs on breeding female blue tits. Although plausible, the alternative that biting midges prefer to feed on more stressed birds is poorly supported by previous studies.

Genus Ranges of 4-Regular Rigid Vertex Graphs

PubMed Central

Buck, Dorothy; Dolzhenko, Egor; Jonoska, Nataša; Saito, Masahico; Valencia, Karin

2016-01-01

A rigid vertex of a graph is one that has a prescribed cyclic order of its incident edges. We study orientable genus ranges of 4-regular rigid vertex graphs. The (orientable) genus range is a set of genera values over all orientable surfaces into which a graph is embedded cellularly, and the embeddings of rigid vertex graphs are required to preserve the prescribed cyclic order of incident edges at every vertex. The genus ranges of 4-regular rigid vertex graphs are sets of consecutive integers, and we address two questions: which intervals of integers appear as genus ranges of such graphs, and what types of graphs realize a given genus range. For graphs with 2n vertices (n > 1), we prove that all intervals [a, b] for all a < b ≤ n, and singletons [h, h] for some h ≤ n, are realized as genus ranges. For graphs with 2n − 1 vertices (n ≥ 1), we prove that all intervals [a, b] for all a < b ≤ n except [0, n], and [h, h] for some h ≤ n, are realized as genus ranges. We also provide constructions of graphs that realize these ranges. PMID:27807395

Fast generation of sparse random kernel graphs

DOE PAGES

Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo

2015-09-10

The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in timemore » at most ο(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.« less

Cognitive and attitudinal predictors related to graphing achievement among pre-service elementary teachers

NASA Astrophysics Data System (ADS)

Szyjka, Sebastian P.

The purpose of this study was to determine the extent to which six cognitive and attitudinal variables predicted pre-service elementary teachers' performance on line graphing. Predictors included Illinois teacher education basic skills sub-component scores in reading comprehension and mathematics, logical thinking performance scores, as well as measures of attitudes toward science, mathematics and graphing. This study also determined the strength of the relationship between each prospective predictor variable and the line graphing performance variable, as well as the extent to which measures of attitude towards science, mathematics and graphing mediated relationships between scores on mathematics, reading, logical thinking and line graphing. Ninety-four pre-service elementary education teachers enrolled in two different elementary science methods courses during the spring 2009 semester at Southern Illinois University Carbondale participated in this study. Each subject completed five different instruments designed to assess science, mathematics and graphing attitudes as well as logical thinking and graphing ability. Sixty subjects provided copies of primary basic skills score reports that listed subset scores for both reading comprehension and mathematics. The remaining scores were supplied by a faculty member who had access to a database from which the scores were drawn. Seven subjects, whose scores could not be found, were eliminated from final data analysis. Confirmatory factor analysis (CFA) was conducted in order to establish validity and reliability of the Questionnaire of Attitude Toward Line Graphs in Science (QALGS) instrument. CFA tested the statistical hypothesis that the five main factor structures within the Questionnaire of Attitude Toward Statistical Graphs (QASG) would be maintained in the revised QALGS. Stepwise Regression Analysis with backward elimination was conducted in order to generate a parsimonious and precise predictive model. This

Nest-site selection and nest success of an Arctic-breeding passerine, Smith's Longspur, in a changing climate

USGS Publications Warehouse

McFarland, Heather R.; Kendall, Steve J.; Powell, Abby

2017-01-01

Despite changes in shrub cover and weather patterns associated with climate change in the Arctic, little is known about the breeding requirements of most passerines tied to northern regions. We investigated the nesting biology and nest habitat characteristics of Smith's Longspurs (Calcarius pictus) in 2 study areas in the Brooks Range of Alaska, USA. First, we examined variation in nesting phenology in relation to local temperatures. We then characterized nesting habitat and analyzed nest-site selection for a subset of nests (n = 86) in comparison with paired random points. Finally, we estimated the daily survival rate of 257 nests found in 2007–2013 with respect to both habitat characteristics and weather variables. Nest initiation was delayed in years with snow events, heavy rain, and freezing temperatures early in the breeding season. Nests were typically found in open, low-shrub tundra, and never among tall shrubs (mean shrub height at nests = 26.8 ± 6.7 cm). We observed weak nest-site selection patterns. Considering the similarity between nest sites and paired random points, coupled with the unique social mating system of Smith's Longspurs, we suggest that habitat selection may occur at the neighborhood scale and not at the nest-site scale. The best approximating model explaining nest survival suggested a positive relationship with the numbers of days above 21°C that an individual nest experienced; there was little support for models containing habitat variables. The daily nest survival rate was high (0.972–0.982) compared with that of most passerines in forested or grassland habitats, but similar to that of passerines nesting on tundra. Considering their high nesting success and ability to delay nest initiation during inclement weather, Smith's Longspurs may be resilient to predicted changes in weather regimes on the breeding grounds. Thus, the greatest threat to breeding Smith's Longspurs associated with climate change may be the loss of low

A model of language inflection graphs

NASA Astrophysics Data System (ADS)

Fukś, Henryk; Farzad, Babak; Cao, Yi

2014-01-01

Inflection graphs are highly complex networks representing relationships between inflectional forms of words in human languages. For so-called synthetic languages, such as Latin or Polish, they have particularly interesting structure due to the abundance of inflectional forms. We construct the simplest form of inflection graphs, namely a bipartite graph in which one group of vertices corresponds to dictionary headwords and the other group to inflected forms encountered in a given text. We, then, study projection of this graph on the set of headwords. The projection decomposes into a large number of connected components, to be called word groups. Distribution of sizes of word group exhibits some remarkable properties, resembling cluster distribution in a lattice percolation near the critical point. We propose a simple model which produces graphs of this type, reproducing the desired component distribution and other topological features.

Nest tree use by the endangered Virginia northern flying squirrel in the central Appalachian Mountains

Treesearch

Jennifer M. Menzel; W. Mark Ford; John W. Edwards; Michael A. Menzel

2004-01-01

Little is known about nest tree use of the endangered Virginia northern flying squirrel (Glaucomys sabrinus fuscus). Because nesting sites could be a limiting factor, it is important to understand the denning ecology to further manage and protect this subspecies. We compared characteristics of nest trees used by Virginia northern flying squirrels...

Nested neural networks

NASA Technical Reports Server (NTRS)

Baram, Yoram

1988-01-01

Nested neural networks, consisting of small interconnected subnetworks, allow for the storage and retrieval of neural state patterns of different sizes. The subnetworks are naturally categorized by layers of corresponding to spatial frequencies in the pattern field. The storage capacity and the error correction capability of the subnetworks generally increase with the degree of connectivity between layers (the nesting degree). Storage of only few subpatterns in each subnetworks results in a vast storage capacity of patterns and subpatterns in the nested network, maintaining high stability and error correction capability.

System analysis through bond graph modeling

NASA Astrophysics Data System (ADS)

McBride, Robert Thomas

2005-07-01

Modeling and simulation form an integral role in the engineering design process. An accurate mathematical description of a system provides the design engineer the flexibility to perform trade studies quickly and accurately to expedite the design process. Most often, the mathematical model of the system contains components of different engineering disciplines. A modeling methodology that can handle these types of systems might be used in an indirect fashion to extract added information from the model. This research examines the ability of a modeling methodology to provide added insight into system analysis and design. The modeling methodology used is bond graph modeling. An investigation into the creation of a bond graph model using the Lagrangian of the system is provided. Upon creation of the bond graph, system analysis is performed. To aid in the system analysis, an object-oriented approach to bond graph modeling is introduced. A framework is provided to simulate the bond graph directly. Through object-oriented simulation of a bond graph, the information contained within the bond graph can be exploited to create a measurement of system efficiency. A definition of system efficiency is given. This measurement of efficiency is used in the design of different controllers of varying architectures. Optimal control of a missile autopilot is discussed within the framework of the calculated system efficiency.

Habitat fragmentation reduces nest survival in an Afrotropical bird community in a biodiversity hotspot

USGS Publications Warehouse

Newmark, W.D.; Stanley, T.R.

2011-01-01

Ecologists have long hypothesized that fragmentation of tropical landscapes reduces avian nest success. However, this hypothesis has not been rigorously assessed because of the difficulty of finding large numbers of well-hidden nests in tropical forests. Here we report that in the East Usambara Mountains in Tanzania, which are part of the Eastern Arc Mountains, a global biodiversity hotspot, that daily nest survival rate and nest success for seven of eight common understory bird species that we examined over a single breeding season were significantly lower in fragmented than in continuous forest, with the odds of nest failure for these seven species ranging from 1.9 to 196.8 times higher in fragmented than continuous forest. Cup-shaped nests were particularly vulnerable in fragments. We then examined over six breeding seasons and 14 study sites in a multivariable survival analysis the influence of landscape structure and nest location on daily nest survival for 13 common species representing 1,272 nests and four nest types (plate, cup, dome, and pouch). Across species and nest types, area, distance of nest to edge, and nest height had a dominant influence on daily nest survival, with area being positively related to nest survival and distance of nest to edge and nest height being both positively and negatively associated with daily nest survival. Our results indicate that multiple environmental factors contribute to reduce nest survival within a tropical understory bird community in a fragmented landscape and that maintaining large continuous forest is important for enhancing nest survival for Afrotropical understory birds.

Habitat fragmentation reduces nest survival in an Afrotropical bird community in a biodiversity hotspot.

PubMed

Newmark, William D; Stanley, Thomas R

2011-07-12

Ecologists have long hypothesized that fragmentation of tropical landscapes reduces avian nest success. However, this hypothesis has not been rigorously assessed because of the difficulty of finding large numbers of well-hidden nests in tropical forests. Here we report that in the East Usambara Mountains in Tanzania, which are part of the Eastern Arc Mountains, a global biodiversity hotspot, that daily nest survival rate and nest success for seven of eight common understory bird species that we examined over a single breeding season were significantly lower in fragmented than in continuous forest, with the odds of nest failure for these seven species ranging from 1.9 to 196.8 times higher in fragmented than continuous forest. Cup-shaped nests were particularly vulnerable in fragments. We then examined over six breeding seasons and 14 study sites in a multivariable survival analysis the influence of landscape structure and nest location on daily nest survival for 13 common species representing 1,272 nests and four nest types (plate, cup, dome, and pouch). Across species and nest types, area, distance of nest to edge, and nest height had a dominant influence on daily nest survival, with area being positively related to nest survival and distance of nest to edge and nest height being both positively and negatively associated with daily nest survival. Our results indicate that multiple environmental factors contribute to reduce nest survival within a tropical understory bird community in a fragmented landscape and that maintaining large continuous forest is important for enhancing nest survival for Afrotropical understory birds.

Habitat fragmentation reduces nest survival in an Afrotropical bird community in a biodiversity hotspot

PubMed Central

Newmark, William D.; Stanley, Thomas R.

2011-01-01

Ecologists have long hypothesized that fragmentation of tropical landscapes reduces avian nest success. However, this hypothesis has not been rigorously assessed because of the difficulty of finding large numbers of well-hidden nests in tropical forests. Here we report that in the East Usambara Mountains in Tanzania, which are part of the Eastern Arc Mountains, a global biodiversity hotspot, that daily nest survival rate and nest success for seven of eight common understory bird species that we examined over a single breeding season were significantly lower in fragmented than in continuous forest, with the odds of nest failure for these seven species ranging from 1.9 to 196.8 times higher in fragmented than continuous forest. Cup-shaped nests were particularly vulnerable in fragments. We then examined over six breeding seasons and 14 study sites in a multivariable survival analysis the influence of landscape structure and nest location on daily nest survival for 13 common species representing 1,272 nests and four nest types (plate, cup, dome, and pouch). Across species and nest types, area, distance of nest to edge, and nest height had a dominant influence on daily nest survival, with area being positively related to nest survival and distance of nest to edge and nest height being both positively and negatively associated with daily nest survival. Our results indicate that multiple environmental factors contribute to reduce nest survival within a tropical understory bird community in a fragmented landscape and that maintaining large continuous forest is important for enhancing nest survival for Afrotropical understory birds. PMID:21709237

Nest construction by a ground-nesting bird represents a potential trade-off between egg crypticity and thermoregulation.

PubMed

Mayer, Paul M; Smith, Levica M; Ford, Robert G; Watterson, Dustin C; McCutchen, Marshall D; Ryan, Mark R

2009-04-01

Predation selects against conspicuous colors in bird eggs and nests, while thermoregulatory constraints select for nest-building behavior that regulates incubation temperatures. We present results that suggest a trade-off between nest crypticity and thermoregulation of eggs based on selection of nest materials by piping plovers (Charadrius melodus), a ground-nesting bird that constructs simple, pebble-lined nests highly vulnerable to predators and exposed to temperature extremes. Piping plovers selected pebbles that were whiter and appeared closer in color to eggs than randomly available pebbles, suggesting a crypsis function. However, nests that were more contrasting in color to surrounding substrates were at greater risk of predation, suggesting an alternate strategy driving selection of white rocks. Near-infrared reflectance of nest pebbles was higher than randomly available pebbles, indicating a direct physical mechanism for heat control through pebble selection. Artificial nests constructed of randomly available pebbles heated more quickly and conferred heat to model eggs, causing eggs to heat more rapidly than in nests constructed from piping plover nest pebbles. Thermal models and field data indicated that temperatures inside nests may remain up to 2-6 degrees C cooler than surrounding substrates. Thermal models indicated that nests heat especially rapidly if not incubated, suggesting that nest construction behavior may serve to keep eggs cooler during the unattended laying period. Thus, pebble selection suggests a potential trade-off between maximizing heat reflectance to improve egg microclimate and minimizing conspicuous contrast of nests with the surrounding substrate to conceal eggs from predators. Nest construction behavior that employs light-colored, thermally reflective materials may represent an evolutionary response by birds and other egg-laying organisms to egg predation and heat stress.

Preserving Differential Privacy in Degree-Correlation based Graph Generation

PubMed Central

Wang, Yue; Wu, Xintao

2014-01-01

Enabling accurate analysis of social network data while preserving differential privacy has been challenging since graph features such as cluster coefficient often have high sensitivity, which is different from traditional aggregate functions (e.g., count and sum) on tabular data. In this paper, we study the problem of enforcing edge differential privacy in graph generation. The idea is to enforce differential privacy on graph model parameters learned from the original network and then generate the graphs for releasing using the graph model with the private parameters. In particular, we develop a differential privacy preserving graph generator based on the dK-graph generation model. We first derive from the original graph various parameters (i.e., degree correlations) used in the dK-graph model, then enforce edge differential privacy on the learned parameters, and finally use the dK-graph model with the perturbed parameters to generate graphs. For the 2K-graph model, we enforce the edge differential privacy by calibrating noise based on the smooth sensitivity, rather than the global sensitivity. By doing this, we achieve the strict differential privacy guarantee with smaller magnitude noise. We conduct experiments on four real networks and compare the performance of our private dK-graph models with the stochastic Kronecker graph generation model in terms of utility and privacy tradeoff. Empirical evaluations show the developed private dK-graph generation models significantly outperform the approach based on the stochastic Kronecker generation model. PMID:24723987

Inferring ontology graph structures using OWL reasoning.

PubMed

Rodríguez-García, Miguel Ángel; Hoehndorf, Robert

2018-01-05

Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies' semantic content remains a challenge. We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph . Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.

Evolutionary Games of Multiplayer Cooperation on Graphs

PubMed Central

Arranz, Jordi; Traulsen, Arne

2016-01-01

There has been much interest in studying evolutionary games in structured populations, often modeled as graphs. However, most analytical results so far have only been obtained for two-player or linear games, while the study of more complex multiplayer games has been usually tackled by computer simulations. Here we investigate evolutionary multiplayer games on graphs updated with a Moran death-Birth process. For cycles, we obtain an exact analytical condition for cooperation to be favored by natural selection, given in terms of the payoffs of the game and a set of structure coefficients. For regular graphs of degree three and larger, we estimate this condition using a combination of pair approximation and diffusion approximation. For a large class of cooperation games, our approximations suggest that graph-structured populations are stronger promoters of cooperation than populations lacking spatial structure. Computer simulations validate our analytical approximations for random regular graphs and cycles, but show systematic differences for graphs with many loops such as lattices. In particular, our simulation results show that these kinds of graphs can even lead to more stringent conditions for the evolution of cooperation than well-mixed populations. Overall, we provide evidence suggesting that the complexity arising from many-player interactions and spatial structure can be captured by pair approximation in the case of random graphs, but that it need to be handled with care for graphs with high clustering. PMID:27513946

QSPR modeling: graph connectivity indices versus line graph connectivity indices

PubMed

Basak; Nikolic; Trinajstic; Amic; Beslo

2000-07-01

Five QSPR models of alkanes were reinvestigated. Properties considered were molecular surface-dependent properties (boiling points and gas chromatographic retention indices) and molecular volume-dependent properties (molar volumes and molar refractions). The vertex- and edge-connectivity indices were used as structural parameters. In each studied case we computed connectivity indices of alkane trees and alkane line graphs and searched for the optimum exponent. Models based on indices with an optimum exponent and on the standard value of the exponent were compared. Thus, for each property we generated six QSPR models (four for alkane trees and two for the corresponding line graphs). In all studied cases QSPR models based on connectivity indices with optimum exponents have better statistical characteristics than the models based on connectivity indices with the standard value of the exponent. The comparison between models based on vertex- and edge-connectivity indices gave in two cases (molar volumes and molar refractions) better models based on edge-connectivity indices and in three cases (boiling points for octanes and nonanes and gas chromatographic retention indices) better models based on vertex-connectivity indices. Thus, it appears that the edge-connectivity index is more appropriate to be used in the structure-molecular volume properties modeling and the vertex-connectivity index in the structure-molecular surface properties modeling. The use of line graphs did not improve the predictive power of the connectivity indices. Only in one case (boiling points of nonanes) a better model was obtained with the use of line graphs.

Unusual raptor nests around the world

USGS Publications Warehouse

Ellis, D.H.; Craig, T.; Craig, E.; Postupalsky, S.; LaRue, C.T.; Nelson, R.W.; Anderson, D.W.; Henny, C.J.; Watson, J.; Millsap, B.A.; Dawson, J.W.; Cole, K.L.; Martin, E.M.; Margalida, A.; Kung, P.

2009-01-01

From surveys in many countries, we report raptors using unusual nesting materials (e.g., paper money, rags, metal, antlers, and large bones) and unusual nesting situations. For example, we documented nests of Steppe Eagles Aquila nipalensis and Upland Buzzards Buteo hemilasius on the ground beside well-traveled roads, Saker Falcon Falco cherrug eyries in attics and a cistern, and Osprey Pandion haliaetus nests on the masts of boats and on a suspended automobile. Other records include a Golden Eagle A. chrysaetos nest 7.0 m in height, believed to be the tallest nest ever described, and, for the same species, we report nesting in rudimentary nests. Some nest sites are within a few meters of known predators or competitors. These unusual observations may be important in revealing the plasticity of a species' behavioral repertoire. ?? 2009 The Raptor Research Foundation, Inc.

Using Behavior Over Time Graphs to Spur Systems Thinking Among Public Health Practitioners.

PubMed

Calancie, Larissa; Anderson, Seri; Branscomb, Jane; Apostolico, Alexsandra A; Lich, Kristen Hassmiller

2018-02-01

Public health practitioners can use Behavior Over Time (BOT) graphs to spur discussion and systems thinking around complex challenges. Multiple large systems, such as health care, the economy, and education, affect chronic disease rates in the United States. System thinking tools can build public health practitioners' capacity to understand these systems and collaborate within and across sectors to improve population health. BOT graphs show a variable, or variables (y axis) over time (x axis). Although analyzing trends is not new to public health, drawing BOT graphs, annotating the events and systemic forces that are likely to influence the depicted trends, and then discussing the graphs in a diverse group provides an opportunity for public health practitioners to hear each other's perspectives and creates a more holistic understanding of the key factors that contribute to a trend. We describe how BOT graphs are used in public health, how they can be used to generate group discussion, and how this process can advance systems-level thinking. Then we describe how BOT graphs were used with groups of maternal and child health (MCH) practitioners and partners (N = 101) during a training session to advance their thinking about MCH challenges. Eighty-six percent of the 84 participants who completed an evaluation agreed or strongly agreed that they would use this BOT graph process to engage stakeholders in their home states and jurisdictions. The BOT graph process we describe can be applied to a variety of public health issues and used by practitioners, stakeholders, and researchers.

The Container Problem in Bubble-Sort Graphs

NASA Astrophysics Data System (ADS)

Suzuki, Yasuto; Kaneko, Keiichi

Bubble-sort graphs are variants of Cayley graphs. A bubble-sort graph is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, in this study, we focus on n-bubble-sort graphs and propose an algorithm to obtain n-1 disjoint paths between two arbitrary nodes in time bounded by a polynomial in n, the degree of the graph plus one. We estimate the time complexity of the algorithm and the sum of the path lengths after proving the correctness of the algorithm. In addition, we report the results of computer experiments evaluating the average performance of the algorithm.

Ringo: Interactive Graph Analytics on Big-Memory Machines.

PubMed

Perez, Yonathan; Sosič, Rok; Banerjee, Arijit; Puttagunta, Rohan; Raison, Martin; Shah, Pararth; Leskovec, Jure

2015-01-01

We present Ringo, a system for analysis of large graphs. Graphs provide a way to represent and analyze systems of interacting objects (people, proteins, webpages) with edges between the objects denoting interactions (friendships, physical interactions, links). Mining graphs provides valuable insights about individual objects as well as the relationships among them. In building Ringo, we take advantage of the fact that machines with large memory and many cores are widely available and also relatively affordable. This allows us to build an easy-to-use interactive high-performance graph analytics system. Graphs also need to be built from input data, which often resides in the form of relational tables. Thus, Ringo provides rich functionality for manipulating raw input data tables into various kinds of graphs. Furthermore, Ringo also provides over 200 graph analytics functions that can then be applied to constructed graphs. We show that a single big-memory machine provides a very attractive platform for performing analytics on all but the largest graphs as it offers excellent performance and ease of use as compared to alternative approaches. With Ringo, we also demonstrate how to integrate graph analytics with an iterative process of trial-and-error data exploration and rapid experimentation, common in data mining workloads.

Ringo: Interactive Graph Analytics on Big-Memory Machines

PubMed Central

Perez, Yonathan; Sosič, Rok; Banerjee, Arijit; Puttagunta, Rohan; Raison, Martin; Shah, Pararth; Leskovec, Jure

2016-01-01

We present Ringo, a system for analysis of large graphs. Graphs provide a way to represent and analyze systems of interacting objects (people, proteins, webpages) with edges between the objects denoting interactions (friendships, physical interactions, links). Mining graphs provides valuable insights about individual objects as well as the relationships among them. In building Ringo, we take advantage of the fact that machines with large memory and many cores are widely available and also relatively affordable. This allows us to build an easy-to-use interactive high-performance graph analytics system. Graphs also need to be built from input data, which often resides in the form of relational tables. Thus, Ringo provides rich functionality for manipulating raw input data tables into various kinds of graphs. Furthermore, Ringo also provides over 200 graph analytics functions that can then be applied to constructed graphs. We show that a single big-memory machine provides a very attractive platform for performing analytics on all but the largest graphs as it offers excellent performance and ease of use as compared to alternative approaches. With Ringo, we also demonstrate how to integrate graph analytics with an iterative process of trial-and-error data exploration and rapid experimentation, common in data mining workloads. PMID:27081215

The many faces of graph dynamics

NASA Astrophysics Data System (ADS)

Pignolet, Yvonne Anne; Roy, Matthieu; Schmid, Stefan; Tredan, Gilles

2017-06-01

The topological structure of complex networks has fascinated researchers for several decades, resulting in the discovery of many universal properties and reoccurring characteristics of different kinds of networks. However, much less is known today about the network dynamics: indeed, complex networks in reality are not static, but rather dynamically evolve over time. Our paper is motivated by the empirical observation that network evolution patterns seem far from random, but exhibit structure. Moreover, the specific patterns appear to depend on the network type, contradicting the existence of a ‘one fits it all’ model. However, we still lack observables to quantify these intuitions, as well as metrics to compare graph evolutions. Such observables and metrics are needed for extrapolating or predicting evolutions, as well as for interpolating graph evolutions. To explore the many faces of graph dynamics and to quantify temporal changes, this paper suggests to build upon the concept of centrality, a measure of node importance in a network. In particular, we introduce the notion of centrality distance, a natural similarity measure for two graphs which depends on a given centrality, characterizing the graph type. Intuitively, centrality distances reflect the extent to which (non-anonymous) node roles are different or, in case of dynamic graphs, have changed over time, between two graphs. We evaluate the centrality distance approach for five evolutionary models and seven real-world social and physical networks. Our results empirically show the usefulness of centrality distances for characterizing graph dynamics compared to a null-model of random evolution, and highlight the differences between the considered scenarios. Interestingly, our approach allows us to compare the dynamics of very different networks, in terms of scale and evolution speed.

How do Neoseiulus californicus (Acari: Phytoseiidae) females penetrate densely webbed spider mite nests?

PubMed

Montserrat, M; de la Peña, F; Hormaza, J I; González-Fernández, J J

2008-02-01

The persea mite Oligonychus perseae is a pest of avocado trees that builds extremely dense webbed nests that protect them against natural enemies, including phytoseiid mites. Nests have one or two marginal entrances that are small and flattened. The predatory mite Neoseiulus californicus co-occurs with O. perseae in the avocado orchards of the south-east of Spain. Penetration inside nests through the entrances by this predator is thought to be hindered by its size and its globular-shaped body. However, in the field it has repeatedly been found inside nests that were clearly ripped. Perhaps penetration of the nests has been facilitated by nest wall ripping caused by some other species or by unfavourable abiotic factors. However, to assess whether N. californicus is also able to enter the nest of O. perseae by itself, we carried out laboratory experiments and made a short film. They show how this predator manages to overcome the webbed wall, and that it can penetrate and forage inside nests of O. perseae.

Probabilistic graphs as a conceptual and computational tool in hydrology and water management

NASA Astrophysics Data System (ADS)

Schoups, Gerrit

2014-05-01

Originally developed in the fields of machine learning and artificial intelligence, probabilistic graphs constitute a general framework for modeling complex systems in the presence of uncertainty. The framework consists of three components: 1. Representation of the model as a graph (or network), with nodes depicting random variables in the model (e.g. parameters, states, etc), which are joined together by factors. Factors are local probabilistic or deterministic relations between subsets of variables, which, when multiplied together, yield the joint distribution over all variables. 2. Consistent use of probability theory for quantifying uncertainty, relying on basic rules of probability for assimilating data into the model and expressing unknown variables as a function of observations (via the posterior distribution). 3. Efficient, distributed approximation of the posterior distribution using general-purpose algorithms that exploit model structure encoded in the graph. These attributes make probabilistic graphs potentially useful as a conceptual and computational tool in hydrology and water management (and beyond). Conceptually, they can provide a common framework for existing and new probabilistic modeling approaches (e.g. by drawing inspiration from other fields of application), while computationally they can make probabilistic inference feasible in larger hydrological models. The presentation explores, via examples, some of these benefits.

Graph Mining Meets the Semantic Web

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Sangkeun; Sukumar, Sreenivas R; Lim, Seung-Hwan

The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today, data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. We address that need through implementation of three popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, and PageRank). We implement these algorithms as SPARQL queries, wrapped within Python scripts. We evaluatemore » the performance of our implementation on 6 real world data sets and show graph mining algorithms (that have a linear-algebra formulation) can indeed be unleashed on data represented as RDF graphs using the SPARQL query interface.« less

Sexually selected nest-building--Pomatoschistus minutus males build smaller nest-openings in the presence of sneaker males.

PubMed

Svensson, O; Kvarnemo, C

2003-09-01

Both natural selection and sexual selection may act on nest-building. We tested experimentally how different regimes of egg-predation and male-male competition influence nest-building before mating, using the marine fish sand goby, Pomatoschistus minutus. Males with sneaker males present built the smallest nest-openings, smaller than males held alone or with Pomatoschistus microps males (which may predate eggs and compete over nest-sites but not compete over fertilizations). Males with visual access to other nest-building males tended also to build smaller openings than males held alone or with P. microps. Males with egg-predators present built nests with openings not differing significantly from any other treatment. Our results indicate that the small nest-openings found in the sneaker male treatment are sexually selected through protection against sneaking or by female choice. Across treatments, time span before a male started to build his nest also explained variation in nest-opening width; males starting late built larger nest-openings.

Graphs as Statements of Belief.

ERIC Educational Resources Information Center

Lake, David

2002-01-01

Identifies points where beliefs are important when making decisions about how graphs are drawn. Describes a simple case of the reaction between 'bicarb soda' and orange or lemon juice and discusses how drawing a graph becomes a statement of belief. (KHR)

A smoothed residual based goodness-of-fit statistic for nest-survival models

Treesearch

Rodney X. Sturdivant; Jay J. Rotella; Robin E. Russell

2008-01-01

Estimating nest success and identifying important factors related to nest-survival rates is an essential goal for many wildlife researchers interested in understanding avian population dynamics. Advances in statistical methods have led to a number of estimation methods and approaches to modeling this problem. Recently developed models allow researchers to include a...

Breeding phenology of birds: mechanisms underlying seasonal declines in the risk of nest predation.

PubMed

Borgmann, Kathi L; Conway, Courtney J; Morrison, Michael L

2013-01-01

Seasonal declines in avian clutch size are well documented, but seasonal variation in other reproductive parameters has received less attention. For example, the probability of complete brood mortality typically explains much of the variation in reproductive success and often varies seasonally, but we know little about the underlying cause of that variation. This oversight is surprising given that nest predation influences many other life-history traits and varies throughout the breeding season in many songbirds. To determine the underlying causes of observed seasonal decreases in risk of nest predation, we modeled nest predation of Dusky Flycatchers (Empidonax oberholseri) in northern California as a function of foliage phenology, energetic demand, developmental stage, conspecific nest density, food availability for nest predators, and nest predator abundance. Seasonal variation in the risk of nest predation was not associated with seasonal changes in energetic demand, conspecific nest density, or predator abundance. Instead, seasonal variation in the risk of nest predation was associated with foliage density (early, but not late, in the breeding season) and seasonal changes in food available to nest predators. Supplemental food provided to nest predators resulted in a numerical response by nest predators, increasing the risk of nest predation at nests that were near supplemental feeders. Our results suggest that seasonal changes in foliage density and factors associated with changes in food availability for nest predators are important drivers of temporal patterns in risk of avian nest predation.

Breeding Phenology of Birds: Mechanisms Underlying Seasonal Declines in the Risk of Nest Predation

PubMed Central

Borgmann, Kathi L.; Conway, Courtney J.; Morrison, Michael L.

2013-01-01

Seasonal declines in avian clutch size are well documented, but seasonal variation in other reproductive parameters has received less attention. For example, the probability of complete brood mortality typically explains much of the variation in reproductive success and often varies seasonally, but we know little about the underlying cause of that variation. This oversight is surprising given that nest predation influences many other life-history traits and varies throughout the breeding season in many songbirds. To determine the underlying causes of observed seasonal decreases in risk of nest predation, we modeled nest predation of Dusky Flycatchers (Empidonax oberholseri) in northern California as a function of foliage phenology, energetic demand, developmental stage, conspecific nest density, food availability for nest predators, and nest predator abundance. Seasonal variation in the risk of nest predation was not associated with seasonal changes in energetic demand, conspecific nest density, or predator abundance. Instead, seasonal variation in the risk of nest predation was associated with foliage density (early, but not late, in the breeding season) and seasonal changes in food available to nest predators. Supplemental food provided to nest predators resulted in a numerical response by nest predators, increasing the risk of nest predation at nests that were near supplemental feeders. Our results suggest that seasonal changes in foliage density and factors associated with changes in food availability for nest predators are important drivers of temporal patterns in risk of avian nest predation. PMID:23776566

Gaseous templates in ant nests.

PubMed

Cox, M D; Blanchard, G B

2000-05-21

We apply a diffusion model to the atmosphere of ant nests. With particular reference to carbon dioxide (CO2), we explore analytically and numerically the spatial and temporal patterns of brood- or worker-produced gases in nests. The maximum concentration within a typical one-chamber ant nest with approximately 200 ants can reach 12.5 times atmospheric concentration, reaching 95% of equilibrium concentrations within 15 min. Maximum concentration increases with increasing number of ants in the nest (or production rate of the gas), distance between the centre of the nest ants and the nest entrance, entrance length, wall thickness, and with decreasing entrance width, wall permeability and diffusion coefficient. The nest can be divided into three qualitatively distinct regions according to the shape of the gradient: a plateau of high concentration in the back half of the nest; an intermediate region of increasingly steep gradient towards the entrance; and a steep linear gradient in the entrance tunnel. These regions are robust to changes in gas concentrations, but vary with changes in nest architecture. The pattern of diffusing gases contains information about position and orientation relative to gas sources and sinks, and about colony state, including colony size, activity state and aspects of nest architecture. We discuss how this diffusion pattern may act as a "dynamic template", providing local cues which trigger behavioural acts appropriate to colony needs, which in turn may feed back to changes in the gas template. In particular, wall building occurs along lines of similar concentration for a variety of nest geometries; there is surprising convergence between the period of cycles of synchronously active ants and the time taken for CO2 levels to equilibrate; and the qualitatively distinct regions of the "dynamic template" correspond to regions occupied by different groups of ants.

Interacting particle systems on graphs

NASA Astrophysics Data System (ADS)

Sood, Vishal

In this dissertation, the dynamics of socially or biologically interacting populations are investigated. The individual members of the population are treated as particles that interact via links on a social or biological network represented as a graph. The effect of the structure of the graph on the properties of the interacting particle system is studied using statistical physics techniques. In the first chapter, the central concepts of graph theory and social and biological networks are presented. Next, interacting particle systems that are drawn from physics, mathematics and biology are discussed in the second chapter. In the third chapter, the random walk on a graph is studied. The mean time for a random walk to traverse between two arbitrary sites of a random graph is evaluated. Using an effective medium approximation it is found that the mean first-passage time between pairs of sites, as well as all moments of this first-passage time, are insensitive to the density of links in the graph. The inverse of the mean-first passage time varies non-monotonically with the density of links near the percolation transition of the random graph. Much of the behavior can be understood by simple heuristic arguments. Evolutionary dynamics, by which mutants overspread an otherwise uniform population on heterogeneous graphs, are studied in the fourth chapter. Such a process underlies' epidemic propagation, emergence of fads, social cooperation or invasion of an ecological niche by a new species. The first part of this chapter is devoted to neutral dynamics, in which the mutant genotype does not have a selective advantage over the resident genotype. The time to extinction of one of the two genotypes is derived. In the second part of this chapter, selective advantage or fitness is introduced such that the mutant genotype has a higher birth rate or a lower death rate. This selective advantage leads to a dynamical competition in which selection dominates for large populations

Some Applications of Graph Theory to Clustering

ERIC Educational Resources Information Center

Hubert, Lawrence J.

1974-01-01

The connection between graph theory and clustering is reviewed and extended. Major emphasis is on restating, in a graph-theoretic context, selected past work in clustering, and conversely, developing alternative strategies from several standard concepts used in graph theory per se. (Author/RC)

On the 2-Extendability of Planar Graphs

DTIC Science & Technology

1989-01-01

connectivity for n-extend- ability of regular graphs, 1988, submitted. [6] L. Lov~isz and M.D. Plummer, Matching Theory, Ann. Discrete Math . 29, North...Holland, Amsterdam, 1986. [7] M.D. Plummer, On n-extendable graphs, Discrete Math . 31, 1980, 201-210. [8] M.D. Plummer, A theorem on matchings in the...plane, Graph Theory in Memory of G.A. Dirac, Ann. Discrete Math . 41, North-Holland, Amsterdam, 1989, 347-354. [9] C. Thomassen, Girth in graphs, J

On the local edge antimagicness of m-splitting graphs

NASA Astrophysics Data System (ADS)

Albirri, E. R.; Dafik; Slamin; Agustin, I. H.; Alfarisi, R.

2018-04-01

Let G be a connected and simple graph. A split graph is a graph derived by adding new vertex v‧ in every vertex v‧ such that v‧ adjacent to v in graph G. An m-splitting graph is a graph which has m v‧-vertices, denoted by mSpl(G). A local edge antimagic coloring in G = (V, E) graph is a bijection f:V (G)\\to \\{1,2,3,\\ldots,|V(G)|\\} in which for any two adjacent edges e 1 and e 2 satisfies w({e}1)\

Techniques for identifying predators of goose nests

USGS Publications Warehouse

Anthony, R. Michael; Grand, J.B.; Fondell, T.F.; Miller, David A.

2006-01-01

We used cameras and artificial eggs to identify nest predators of dusky Canada goose Branta canadensis occidentalis nests during 1997-2000. Cameras were set up at 195 occupied goose nests and 60 artificial nests. We placed wooden eggs and domestic goose eggs that were emptied and then filled with wax or foam in an additional 263 natural goose nests to identify predators from marks in the artificial eggs. All techniques had limitations, but each correctly identified predators and estimated their relative importance. Nests with cameras had higher rates of abandonment than natural nests, especially during laying. Abandonment rates were reduced by deploying artificial eggs late in laying and reducing time at nests. Predation rates for nests with cameras were slightly lower than for nests without cameras. Wax-filled artificial eggs caused mortality of embryos in natural nests, but were better for identifying predator marks at artificial nests. Use of foam-filled artificial eggs in natural nests was the most cost effective means of monitoring nest predation. ?? Wildlife Biology (2006).

Graph cuts via l1 norm minimization.

PubMed

Bhusnurmath, Arvind; Taylor, Camillo J

2008-10-01

Graph cuts have become an increasingly important tool for solving a number of energy minimization problems in computer vision and other fields. In this paper, the graph cut problem is reformulated as an unconstrained l1 norm minimization that can be solved effectively using interior point methods. This reformulation exposes connections between the graph cuts and other related continuous optimization problems. Eventually the problem is reduced to solving a sequence of sparse linear systems involving the Laplacian of the underlying graph. The proposed procedure exploits the structure of these linear systems in a manner that is easily amenable to parallel implementations. Experimental results obtained by applying the procedure to graphs derived from image processing problems are provided.

Nest-site selection by cavity-nesting birds in relation to postfire salvage logging

Treesearch

Victoria A. Saab; Robin E. Russell; Jonathan G. Dudley

2009-01-01

Large wildfire events in coniferous forests of the western United States are often followed by postfire timber harvest. The long-term impacts of postfire timber harvest on fire-associated cavity-nesting bird species are not well documented. We studied nest-site selection by cavity-nesting birds over a 10-year period (1994-2003), representing 1-11 years after fire, on...

Contrasting nest survival patterns for ducks and songbirds in northern mixed-grass prairie

USGS Publications Warehouse

Grant, Todd; Shaffer, Terry L.; Madden, Elizabeth M.; Nenneman, Melvin P.

2017-01-01

Management actions intended to protect or improve habitat for ducks may benefit grassland-nesting passerines, but scant information is available to explore this assumption. During 1998–2003, we examined nest survival of ducks and songbirds to determine whether effects of prescribed fire and other habitat features (e.g., shrub cover and distance to habitat edges) were similar for ducks and passerines breeding in North Dakota. We used the logistic-exposure method to estimate survival of duck and songbird nests (n = 3,171). We used an information-theoretic approach to identify factors that most influenced nest survival. Patterns of nest survival were markedly different between taxonomic groups. For ducks, nest survival was greater during the first postfire nesting season (daily survival rate [DSR] = 0.957, 85% CI = 0.951–0.963), relative to later postfire nesting seasons (DSR = 0.946, 85% CI = 0.942–0.950). Furthermore duck nest survival and nest densities were inversely related. Duck nest survival also was greater as shrub cover decreased and as distance from cropland and wetland edges increased. Passerines had lower nest survival during the first postfire nesting season (DSR = 0.934, 85% CI = 0.924–0.944), when densities also were low compared to subsequent postfire nesting seasons (DSR = 0.947, 85% CI = 0.944–0.950). Parasitism by brown-headed cowbirds (Molothrus ater) reduced passerine nest survival and this effect was more pronounced during the first postfire nesting season compared to subsequent nesting seasons. Passerine nest survival was greater as shrub cover decreased and perhaps for more concealed nests. Duck and songbird nest survival rates were not correlated during this study and for associated studies that examined additional variables using the same dataset, suggesting that different mechanisms influenced their survival. Based on our results, ducks should not be considered direct surrogates for passerines

Disease management research using event graphs.

PubMed

Allore, H G; Schruben, L W

2000-08-01

Event Graphs, conditional representations of stochastic relationships between discrete events, simulate disease dynamics. In this paper, we demonstrate how Event Graphs, at an appropriate abstraction level, also extend and organize scientific knowledge about diseases. They can identify promising treatment strategies and directions for further research and provide enough detail for testing combinations of new medicines and interventions. Event Graphs can be enriched to incorporate and validate data and test new theories to reflect an expanding dynamic scientific knowledge base and establish performance criteria for the economic viability of new treatments. To illustrate, an Event Graph is developed for mastitis, a costly dairy cattle disease, for which extensive scientific literature exists. With only a modest amount of imagination, the methodology presented here can be seen to apply modeling to any disease, human, plant, or animal. The Event Graph simulation presented here is currently being used in research and in a new veterinary epidemiology course. Copyright 2000 Academic Press.

A Visual Evaluation Study of Graph Sampling Techniques

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Fangyan; Zhang, Song; Wong, Pak C.

2017-01-29

We evaluate a dozen prevailing graph-sampling techniques with an ultimate goal to better visualize and understand big and complex graphs that exhibit different properties and structures. The evaluation uses eight benchmark datasets with four different graph types collected from Stanford Network Analysis Platform and NetworkX to give a comprehensive comparison of various types of graphs. The study provides a practical guideline for visualizing big graphs of different sizes and structures. The paper discusses results and important observations from the study.

The Kirchhoff Index of Quasi-Tree Graphs

NASA Astrophysics Data System (ADS)

Xu, Kexiang; Liu, Hongshuang; Das, Kinkar Ch.

2015-03-01

Resistance distance was introduced by Klein and Randić as a generalisation of the classical distance. The Kirchhoff index Kf(G) of a graph G is the sum of resistance distances between all unordered pairs of vertices. In this article we characterise the extremal graphs with the maximal Kirchhoff index among all non-trivial quasi-tree graphs of order n. Moreover, we obtain a lower bound on the Kirchhoff index for all non-trivial quasi-tree graphs of order n.

Measuring Two-Event Structural Correlations on Graphs

DTIC Science & Technology

2012-08-01

2012 to 00-00-2012 4. TITLE AND SUBTITLE Measuring Two-Event Structural Correlations on Graphs 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ...by event simulation on the DBLP graph. Then we examine the efficiency and scala - bility of the framework with a Twitter network. The third part of...correlation pattern mining for large graphs. In Proc. of the 8th Workshop on Mining and Learning with Graphs, pages 119–126, 2010. [23] T. Smith. A

Experimental quantum annealing: case study involving the graph isomorphism problem.

PubMed

Zick, Kenneth M; Shehab, Omar; French, Matthew

2015-06-08

Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-based solvers require a combination of annealing and classical pre- and post-processing; at this early stage, little is known about how to partition and optimize the processing. This article presents an experimental case study of quantum annealing and some of the factors involved in real-world solvers, using a 504-qubit D-Wave Two machine and the graph isomorphism problem. To illustrate the role of classical pre-processing, a compact Hamiltonian is presented that enables a reduced Ising model for each problem instance. On random N-vertex graphs, the median number of variables is reduced from N(2) to fewer than N log2 N and solvable graph sizes increase from N = 5 to N = 13. Additionally, error correction via classical post-processing majority voting is evaluated. While the solution times are not competitive with classical approaches to graph isomorphism, the enhanced solver ultimately classified correctly every problem that was mapped to the processor and demonstrated clear advantages over the baseline approach. The results shed some light on the nature of real-world quantum annealing and the associated hybrid classical-quantum solvers.

Experimental quantum annealing: case study involving the graph isomorphism problem

PubMed Central

Zick, Kenneth M.; Shehab, Omar; French, Matthew

2015-01-01

Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-based solvers require a combination of annealing and classical pre- and post-processing; at this early stage, little is known about how to partition and optimize the processing. This article presents an experimental case study of quantum annealing and some of the factors involved in real-world solvers, using a 504-qubit D-Wave Two machine and the graph isomorphism problem. To illustrate the role of classical pre-processing, a compact Hamiltonian is presented that enables a reduced Ising model for each problem instance. On random N-vertex graphs, the median number of variables is reduced from N2 to fewer than N log2 N and solvable graph sizes increase from N = 5 to N = 13. Additionally, error correction via classical post-processing majority voting is evaluated. While the solution times are not competitive with classical approaches to graph isomorphism, the enhanced solver ultimately classified correctly every problem that was mapped to the processor and demonstrated clear advantages over the baseline approach. The results shed some light on the nature of real-world quantum annealing and the associated hybrid classical-quantum solvers. PMID:26053973

Nest-site characteristics and linear abundance of cliff-nesting American kestrels on San Clemente Island, California

USGS Publications Warehouse

Sullivan, Brian L.; Kershner, Eric L.; Finn, S.P.; Condon, Anne M.; Cooper, Douglass M.; Garcelon, David K.

2003-01-01

American Kestrels( Falco sparverius) are typically secondary-cavity nesters, and use of natural cliff cavities for nest sites is less-commonly reported. On San Clemente Island (SCI), California, however, American Kestrels nest primarily on cliffs in major canyons(93%), to a lesser extent on seacliffs(4%), as well as in man-made structures (3%). We located and mapped 99 American Kestrel territories on SCI, and recorded 11 nest-site characteristics at 40 cliff nests during 2001-02. Nest cliffs were typically fractured igneous rock with mean height of 16.1 m +_ 1.8 SE. Mean slope of nest cliffs was vertical (x=91 degrees). Nest cliffs and cavities were significantly oriented to the southeast, away from the prevailing wind direction(NW). In eight canyons, where we believe that we found all occupied American Kestrel territories, the mean linear abundance was 2.1 pairs/km, greater than most published estimates. Contrary to most previous studies, no American Kestrels nested in tree cavities despite their presence in SCI canyons. The absence of cavity-excavating breeding birds from the island likely restricts kestrels to nesting in naturally-formed cavities and man-made structures.

Model of the best-of-N nest-site selection process in honeybees

NASA Astrophysics Data System (ADS)

Reina, Andreagiovanni; Marshall, James A. R.; Trianni, Vito; Bose, Thomas

2017-05-01

The ability of a honeybee swarm to select the best nest site plays a fundamental role in determining the future colony's fitness. To date, the nest-site selection process has mostly been modeled and theoretically analyzed for the case of binary decisions. However, when the number of alternative nests is larger than two, the decision-process dynamics qualitatively change. In this work, we extend previous analyses of a value-sensitive decision-making mechanism to a decision process among N nests. First, we present the decision-making dynamics in the symmetric case of N equal-quality nests. Then, we generalize our findings to a best-of-N decision scenario with one superior nest and N -1 inferior nests, previously studied empirically in bees and ants. Whereas previous binary models highlighted the crucial role of inhibitory stop-signaling, the key parameter in our new analysis is the relative time invested by swarm members in individual discovery and in signaling behaviors. Our new analysis reveals conflicting pressures on this ratio in symmetric and best-of-N decisions, which could be solved through a time-dependent signaling strategy. Additionally, our analysis suggests how ecological factors determining the density of suitable nest sites may have led to selective pressures for an optimal stable signaling ratio.

Model of the best-of-N nest-site selection process in honeybees.

PubMed

Reina, Andreagiovanni; Marshall, James A R; Trianni, Vito; Bose, Thomas

2017-05-01

The ability of a honeybee swarm to select the best nest site plays a fundamental role in determining the future colony's fitness. To date, the nest-site selection process has mostly been modeled and theoretically analyzed for the case of binary decisions. However, when the number of alternative nests is larger than two, the decision-process dynamics qualitatively change. In this work, we extend previous analyses of a value-sensitive decision-making mechanism to a decision process among N nests. First, we present the decision-making dynamics in the symmetric case of N equal-quality nests. Then, we generalize our findings to a best-of-N decision scenario with one superior nest and N-1 inferior nests, previously studied empirically in bees and ants. Whereas previous binary models highlighted the crucial role of inhibitory stop-signaling, the key parameter in our new analysis is the relative time invested by swarm members in individual discovery and in signaling behaviors. Our new analysis reveals conflicting pressures on this ratio in symmetric and best-of-N decisions, which could be solved through a time-dependent signaling strategy. Additionally, our analysis suggests how ecological factors determining the density of suitable nest sites may have led to selective pressures for an optimal stable signaling ratio.

Greater sage-grouse nest predators in the Virginia Mountains of northwestern Nevada

USGS Publications Warehouse

Lockyer, Zachary B.; Coates, Peter S.; Casazza, Michael L.; Espinosa, Shawn; Delehanty, David J.

2013-01-01

Greater sage-grouse Centrocercus urophasianus, hereafter sage-grouse, populations have declined across their range due to the loss, degradation, and fragmentation of habitat. Habitat alterations can lead not only to vegetative changes but also to shifts in animal behavior and predator composition that may influence population vital rates, such as nest success. For example, common ravens Corvus corax are sage-grouse nest predators, and common raven abundance is positively associated with human-caused habitat alterations. Because nest success is a central component to sage-grouse population persistence, research that identifies factors influencing nest success will better inform conservation efforts. We used videography to unequivocally identify sage-grouse nest predators within the Virginia Mountains of northwestern Nevada, USA, from 2009 to 2011 and used maximum likelihood to calculate daily probability of nest survival. In the Virginia Mountains, fires, energy exploration, and other anthropogenic activities have altered historic sage-grouse habitat. We monitored 71 sage-grouse nests during the study, placing video cameras at 39 nests. Cumulative nest survival for all nests was 22.4% (95% CI, 13.0–33.4%), a survival rate that was significantly lower than other published results for sage-grouse in the Great Basin. Depredation was the primary cause for nest failure in our study (82.5%), and common ravens were the most frequent sage-grouse nest predator, accounting for 46.7% of nest depredations. We also successfully documented a suite of mammalian and reptilian species depredating sage-grouse nests, including some predators never previously confirmed in the literature to be sage-grouse nest predators (i.e., bobcats Lynx rufus and long-tailed weasels Mephitis frenata). Within the high elevation, disturbed habitat of the Virginia Mountains, low sage-grouse nest success may be limiting sage-grouse population growth. These results suggest that management actions that

Nesting behavior of the poo-uli

USGS Publications Warehouse

Kepler, C.B.; Pratt, T.K.; Ecton, A.M.; Engilis, A.; Fluetsch, K.M.

1996-01-01

We describe two sequential nestings of a pair of Poo-uli (Melamprosops phaeosoma), a Hawaiian honeycreeper nearing extinction. Similarities to nesting of most other honeycreepers included: nest site in ohia lehua (Metrosideros polymorpha Gaud.) canopy; breeding in March through June; monogamous breeding system with the putative male helping build the nest, feeding the putative female throughout each nesting event, and feeding the chicks, but not incubating or brooding; and complete nest sanitation. Notable differences were the paucity of songs and calls by the parents and inclusion of snails in the diet of nestlings. Clutch size was probably two eggs for both nests. High winds, rain, or both influenced parental behavior: the female stayed longer on the nest and took shorter recesses in poor weather. Weather did not affect rates at which the male fed the female on the nest; however, the feeding rate increased from the egg to the chick stage probably because food was passed on to the chicks. At nest #2, parents fed young chicks (<14 days old) more often in good than in poor weather; data were insufficient for old chicks. Weather is usually poor throughout the year in the relictual range of the Poo-uli and is likely to impact nesting success. The first nest failed in poor weather. The second fledged a single young 21 days old. Diet of nestlings appeared to consist of a higher proportion of insect larvae than that of older birds, which are reported to eat mostly snails.

Flying through Graphs: An Introduction to Graph Theory.

ERIC Educational Resources Information Center

McDuffie, Amy Roth

2001-01-01

Presents an activity incorporating basic terminology, concepts, and solution methods of graph theory in the context of solving problems related to air travel. Discusses prerequisite knowledge and resources and includes a teacher's guide with a student worksheet. (KHR)

Convergence of the Graph Allen-Cahn Scheme

NASA Astrophysics Data System (ADS)

Luo, Xiyang; Bertozzi, Andrea L.

2017-05-01

The graph Laplacian and the graph cut problem are closely related to Markov random fields, and have many applications in clustering and image segmentation. The diffuse interface model is widely used for modeling in material science, and can also be used as a proxy to total variation minimization. In Bertozzi and Flenner (Multiscale Model Simul 10(3):1090-1118, 2012), an algorithm was developed to generalize the diffuse interface model to graphs to solve the graph cut problem. This work analyzes the conditions for the graph diffuse interface algorithm to converge. Using techniques from numerical PDE and convex optimization, monotonicity in function value and convergence under an a posteriori condition are shown for a class of schemes under a graph-independent stepsize condition. We also generalize our results to incorporate spectral truncation, a common technique used to save computation cost, and also to the case of multiclass classification. Various numerical experiments are done to compare theoretical results with practical performance.

Graph Drawing Aesthetics-Created by Users, Not Algorithms.

PubMed

Purchase, H C; Pilcher, C; Plimmer, B

2012-01-01

Prior empirical work on layout aesthetics for graph drawing algorithms has concentrated on the interpretation of existing graph drawings. We report on experiments which focus on the creation and layout of graph drawings: participants were asked to draw graphs based on adjacency lists, and to lay them out "nicely." Two interaction methods were used for creating the drawings: a sketch interface which allows for easy, natural hand movements, and a formal point-and-click interface similar to a typical graph editing system. We find, in common with many other studies, that removing edge crossings is the most significant aesthetic, but also discover that aligning nodes and edges to an underlying grid is important. We observe that the aesthetics favored by participants during creation of a graph drawing are often not evident in the final product and that the participants did not make a clear distinction between the processes of creation and layout. Our results suggest that graph drawing systems should integrate automatic layout with the user's manual editing process, and provide facilities to support grid-based graph creation.