Downloads & Free Reading Options - Results

Collection of US news similarity graphs generated in May 2024

Collection of US news similarity graphs generated in October 2017

This study aims to assess the effectiveness of journal policies in reducing the proportion of original research papers that use bar graphs inappropriately to show continuous data. Defining the sampling frame (completed): Journals from 20 different subject categories in the fields of “Clinical Medicine” and “Biology & Biochemistry” in Journal Citation Reports were screened for policies on the use of bar graphs to visualize continuous data. Author guidelines and instructions to authors of these journals were screened manually to identify journals that have specific policies that recommend against using bar graphs to display continuous data. Each journal with a “no bar graphs” policy was matched to two journals without such policies. Matching journals were selected from the same subject category, based on a comparable journal impact factor. For each journal with a policy, we manually chose among the closest journals without a policy on the impact factor list for the field. Each journal was only used once. Impact factors are a highly flawed metric and we do not endorse their use, especially for evaluation of individual research studies (Adler 2009, Bladek 2013). However, we have used them here to identify similar journals with and without policies. Editors of journals with “no bar graphs” policies were contacted to determine what year the policy was introduced, if this information could not be determined from editorials or dates on the policy documents. We used the Wayback Machine (RRID:SCR_025022) to access websites containing old policies and authors guidelines to determine the year of policy change for journals whose editors did not reply to our query. Data collection and analysis (to be completed): All original articles from the selected journals published between 2010 and 2022 will be downloaded. Original research articles will be identified and downloaded using an automated process. We first searched for all articles published in the journals included in our sample during the study time period. We used the PubMed query options to remove the following publication types from the results: "comment", "english abstract", "ephemera", "letter", "publication components", "review", "editorial", "news", "biography", "published erratum", "congress", "pictorial work", "electronic supplementary materials", "video audio media", "guideline", "practice guideline", "interview", "newspaper article", "retraction of publication", "retracted publication", "bibliography", "consensus development conference", "systematic review", "expression of concern", "overall", "personal narrative", "case reports", "collected work", "popular work", "pictorial work", and "portrait". Some papers may be uncategorized or categorized incorrectly. We further reduced the proportion of non-research articles by using regular expressions in R to filter the retrieved articles based on their meta-data, including titles and abstracts. We excluded articles without an abstract, articles that were missing DOI, and articles containing any of the following words in the title: "Linked Article", "Abstract", "Erratum", "Corrigendum", "Editorial", "Letter", "Reply", "Image of", "Case of", "Systematic Review", "Meta-Analysis". Manual reviews of 100 articles demonstrated that the proportion of original research articles was 0.92 when using this search strategy. All downloaded articles will be screened by an automated tool (BARzooka). The tool screens scientific articles for the presence of nine types of graphs. In this study, BARzooka will provide data on the proportion of articles that include bar graphs of continuous data, as well as the proportion of articles that include more informative figures (dot plots, box plots, histograms, violin plots). We will examine changes in bar graph use over time, in journals with vs. without “no bar graphs” policies, to assess whether journal policies reduce the proportion of papers that inappropriately use bar graphs to display continuous data, after accounting for changes in baseline rates of bar graph use.

Collection of US news similarity graphs generated in October 2023

Collection of US news similarity graphs generated in January 2019

Understanding Gibbs measures on trees and their spatial mixing thresholds (uniqueness, strong spatial mixing, reconstruction) can give insight into the behavior of Gibbs measures on general graphs, in particular random graphs which are locally tree-like. We discuss two results: In the first result, we show that counter to the general notion that the d regular tree is the worst case for decay of correlation between sets and nodes among all d regular graphs, we produce an example of a spin interacting system which has uniqueness on the d-regular tree but does not have uniqueness on some infinite d-regular graphs. In the second result we overcome an obstacle of most techniques for analysing the mixing time of the Glauber dynamics, i.e., that they are stated in terms of maximal degree and are therefore insufficient for Erdos Renyi random graphs where the maximum degree grows as order (logn)/(log log n). We show that for most natural models defined on G(n,d/n) if the 'temperature' is high enough (as a function of d only) then the mixing time of Glauber dynamics is polynomial. This proves in particular a conjecture of Dyer et.al. proving rapid mixing of random colourings on G(n,d/n) with a constant number of colours. ©2007 Microsoft Corporation. All rights reserved.

Coloring a k -colorable graph using k colors ( k≥ 3 ) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the uniform distribution over k -colorable graphs with n vertices and exactly cn edges, c greater than some sufficiently large constant. We rigorously show that all proper k -colorings of most such graphs are clustered in one cluster, and agree on all but a small, though constant, number of vertices. We also show that some polynomial time algorithm can find a proper k -coloring of such a random k -colorable graph whp , thus asserting that most such graphs are easy. This should be contrasted with the setting of very sparse random graphs (which are k -colorable whp ), where experimental results show some regime of edge density to be difficult for many coloring heuristics. One explanation for this phenomenon, backed up by partially non-rigorous analytical tools from statistical physics, is the complicated clustering of the solution space at that regime, unlike the more “regular” structure that denser graphs possess. Thus in some sense, our result rigorously supports this explanation. ©2007 Microsoft Corporation. All rights reserved.

There's a lot of hype about knowledge graphs and AI-methods for building or using them, but what exactly is a knowledge graph? How is it different from a database or other data store? How can I build my own knowledge graph? James Fletcher from Grakn Labs helps us understand knowledge graphs in general and some practical steps towards creating your own. He also discusses graph neural networks and the future of graph-augmented methods.

Graphs are powerful means to visually convey specific types of information such as temporal changes in quantity, differences in frequencies and proportions. Since they are a means of communication they need, much as words and utterances, to be interpreted. In this project, we aim to investigate how the manipulation of the salience of certain graph constituents would drive people to interpret visualizations differently.

Graphs are powerful means to visually convey specific types of information such as temporal changes in quantity, differences in frequencies and proportions. Since they are a means of communication they need, much as words and utterances, to be interpreted. In this project, we aim to investigate how the manipulation of the salience of certain graph constituents would drive people to interpret visualizations differently.

To develop effective climate change policy, decision-makers need to have good understanding of climate science. The IPCC Assessment Reports therefore aim to lay the foundation for informed decision-making by providing policy-relevant information. Although IPCC reports display key information in graphs, recent research indicates that IPCC authors themselves indicate that these graph can be difficult to interpret (Harold 2020), and the design of graphs can result in systematic misinterpretations of the presented findings (Fisher et al 2020). Although suggestions have also been made to improve the design and understanding of these graphs (Harold et al. 2016), these have not yet been tested empirically. This study aims to test various adaptation of IPCC graphics to assess the impact of such changes on policy maker's understanding of these graphics. We have adapted 2 graphics from the IPCC summary for policy makers, and included one adaptation that IPCC implemented themselves. For the first graphic, we took Figure SPM.5 from the Special Report on the Ocean and Cryosphere in a Changing Climate (SROCC) (IPCC, 2019) (Graphic 1A) and adapted this graphic (Graphic 1B). We disentangled two layers of information in the adapted version: whilst the original has the sea level risk in 2100 under different seal level rise under response scenario's AND the relative contribution of response options to risk reduction integrated in one figure, we adapted this figure to present these two types of information in two separate graphics. We expect that this will ease interpretation of the presented information and enhance the accuracy of interpretation. For the second graphic , we took Figure SPM.4 (Graphic 2A), from the Special Report Global Warming of 1.5 ºC (SR15) (IPCC, 2018) and adapted this figure (Graphic 2B). In the adapted version, we included an example that illustrated how the graphic should accurately be interpreted. The example explained the trade-offs and synergies of the SDG1 in the energy sector, explaining (1) how the bars indicating the synergies and trade-offs should be interpreted (2) the total confidence levels of the synergies and trade-offs (3) the differences in confidence levels for different levels of synergies and trade-offs. This example is to guide participants to interpret the graphic, by giving them a step by step interpretation of 1 specific section of the graphic, that the participants can extrapolate to the rest of the graphic. For the third graphic, we took SPM.2 from SR15 (IPCC, 2018) (Graphic 3A) and adapted this figure (IPCC, 2019) (Graphic 3B). The original graph indicates confidence levels with letters (L, M, H), which viewers may conflate with the level of added impact/risk displayed in the bars. Hence the adapted graph employed symbols to indicate level of confidence (similar to SPM3 from SROCC (IPCC, 2019), in which the number of dots next to the bar indicate the level of confidence.

In this talk, I will present techniques for organizing two types of photo collections downloaded from Flickr.com: (1) famous landmark sites such as the Statue of Liberty and (2) general visual concepts such as “love” and “beauty.” In the first part of the talk, I will present a system that integrates 2D appearance and 3D geometric constraints to efficiently build 3D models of landmarks, extract scene summaries, and recognize the landmark in new test images. The system starts by clustering images using low-dimensional global 'gist' descriptors and then performs geometric verification to retain only the clusters whose images share a common 3D structure. Each valid cluster is represented by a single iconic view, and geometric relationships between iconic views are captured in an iconic scene graph. In addition to serving as a compact scene summary, this graph is used to guide structure from motion to efficiently produce 3D models covering most of the scene content. The set of iconic images can be also used for recognition, i.e., determining whether new test images contain the landmark. In the second part of the talk, I will discuss the problem of computing iconic summaries for more general visual concepts that are not characterized by rigid 3D geometry. In this case, it is more appropriate to define iconic images as representatives of subsets of the collection consistent in terms of global 2D appearance and semantics. Such subsets are found by jointly clustering images using 'gist' descriptors and Flickr tags. For each joint cluster, a representative iconic image is selected using an automatic quality-based ranking scheme. To visualize the resulting summary, iconic images are grouped according to their semantic “theme” (tag-based cluster) and multidimensional scaling is used to compute a 2D layout reflecting the relationships between the themes. ©2008 Microsoft Corporation. All rights reserved.

Collection of US news similarity graphs generated in November 2020

This paper is in the public domain in USA. Metadata comes from the CrossRef API, see full record in the source URL below.

This paper is in the public domain in USA. Metadata comes from the CrossRef API, see full record in the source URL below.

In this paper we prove that the arbitrary supersubdivisions of paths, disconnected paths, cycles and stars are one modulo N graceful for all positive integers N.

/Media_Releases/mbi/2015/Documents/03. Set of related graphs - 13 Oct 2015.pdf

/Media_Releases/s71/1617/3rd_1617/Documents/01. Analysis of Cash Flow - 31 March 2017 (with graphs).xls

/Media_Releases/s71/1617/3rd_1617/Documents/01. Analysis of Cash Flow - 31 March 2017 (with graphs).xls

/Media_Releases/s71/1617/3rd_1617/Documents/01. Analysis of Cash Flow - 31 March 2017 (with graphs).xls

Stina Bridgeman's bachelors thesis on "Finding Hamiltonian Cycles in Grid Graphs Without Holes" (1995)

Process Algebra forms a cornerstone in the formal methods area of Computer Science. Among the more widely used approaches is Milner's Communication and Concurrency Systems (CCS). Recently CCS has been extended by Schmidt and Bibighaus through the introduction of Doubly Labeled Transition Systems. This framework has enhanced the model's ability to capture security and availability properties. In this thesis we reformulate, simplify, and extend Bibighaus' work using a graph theoretic framework. The intent is that this abstract mathematical view will make the results more accessible and stimulate additional research. Existing definitions and theorems are redefined and proved using Labeled and Doubly Labeled Transition Graphs (LTG and DLTG). CCS simulation concepts are recast as graph morphisms and the notion of abstraction and refinement are explained through the use of graphs. Bibighaus' work is extended by showing how to carry out non-atomic DLTG refinement, and by developing a form of graph composition involving graph refinements that share a common abstract graph. This type of composition is proven to always be possible with DLTG refinements, and we demonstrate that the composite graph is both a refinement of the abstract graph, and an abstract graph for the refinements from which it was made.

Collection of US news similarity graphs generated in August 2022

Collection of US news similarity graphs generated in August 2022

Collection of US news similarity graphs generated in August 2022

Collection of US news similarity graphs generated in August 2022

/Media_Releases/s71/1112/2nd_1112/Documents/Excel/01. Summary of actual Cash Flow - 2nd Q S71 - 31 January 2012 with graphs.xls

/Media_Releases/s71/1112/2nd_1112/Documents/Excel/01. Summary of actual Cash Flow - 2nd Q S71 - 31 January 2012 with graphs.xls

No Abstract Available

No Abstract Available

No Abstract Available

No Abstract Available

Sharing a common view while collaborating in networked virtual environments is complex. The SOFT project examines a new approach: using generic scene graphs as a bus, for graphics distribution. This thesis (as part of the SOFT project) examines network architecture for distribution of generic scene graphs. We design and implement the network architecture with a centralized Java server. This server provides scalability, persistence, reliability, and latecomer support. The server provides interoperability and can support any SSGs on any platform. The extraction of information from the network layer is implemented in two ways. In the first, we use Java's inherent serialization mechanisms; in the second, we use the Dial a Behavior (DaBP) protocol. We empirically test the server's overhead with both network mechanisms. We have concluded that using DaBP significantly reduces the server's overhead by a factor of six but only for less than 50,000 packets. Moreover, the use of DaBP provides implementation flexibility because data format can change dynamically without requiring recompilation. Finally, DaBP, while promising, must mature and be shown to reduce overhead for large number of packets before it is ready to be incorporated into the final architecture solution for SOFT.

"Graphs of the Functions Π and Ψ" is an article from The Annals of Mathematics, Volume 5 . View more articles from The Annals of Mathematics . View this article on JSTOR . View this article's JSTOR metadata . You may also retrieve all of this items metadata in JSON at the following URL: https://archive.org/metadata/jstor-2007165

"Graphs of the Functions Π and Ψ" is an article from The Annals of Mathematics, Volume 5 . View more articles from The Annals of Mathematics . View this article on JSTOR . View this article's JSTOR metadata . You may also retrieve all of this items metadata in JSON at the following URL: https://archive.org/metadata/jstor-2007165

"Graphs of the Functions Π and Ψ" is an article from The Annals of Mathematics, Volume 5 . View more articles from The Annals of Mathematics . View this article on JSTOR . View this article's JSTOR metadata . You may also retrieve all of this items metadata in JSON at the following URL: https://archive.org/metadata/jstor-2007165

Journal of Research of the National Bureau of Standards

Journal of Research of the National Bureau of Standards

Journal of Research of the National Bureau of Standards

345 pages :

Book digitized by Google from the library of Harvard University and uploaded to the Internet Archive by user tpb.

For systems of automated translation and morphological processor of full-text information search systems with a natural language interface, an algorithm for determining all characteristics of word forms of substantive and adjectival declension using morpheme graphs.

Was detected fact of identity noncylindrical graphs with 3-minimal planar graphs and proposed new modification of algorithm for construction all 3-minimal graphs, there was based on method of ϕ-transformations of graphs. 

Was detected fact of identity noncylindrical graphs with 3-minimal planar graphs and proposed new modification of algorithm for construction all 3-minimal graphs, there was based on method of ϕ-transformations of graphs. 

Was detected fact of identity noncylindrical graphs with 3-minimal planar graphs and proposed new modification of algorithm for construction all 3-minimal graphs, there was based on method of ϕ-transformations of graphs. 

Was detected fact of identity noncylindrical graphs with 3-minimal planar graphs and proposed new modification of algorithm for construction all 3-minimal graphs, there was based on method of ϕ-transformations of graphs. 

Was detected fact of identity noncylindrical graphs with 3-minimal planar graphs and proposed new modification of algorithm for construction all 3-minimal graphs, there was based on method of ϕ-transformations of graphs. 

A graph G is said to be Smarandachely harmonic graph with property P if its vertices can be labeled 1, 2, ···, n such that the function f P : A → Q defined by f p (H) = , H ∈ A   is injective. Particularly, if A is the collection of all paths of length 1 in G (That is, A = E(G)), then a Smarandachely harmonic graph is called Strongly harmonic graph. In this paper we show that all cycles, wheels, trees and grids are strongly harmonic graphs. Also, we give an upper bound and a lower bound for μ(n), the maximum number of edges in a strongly harmonic graph of order n.

A graph G is said to be Smarandachely harmonic graph with property P if its vertices can be labeled 1, 2, ···, n such that the function f P : A → Q defined by f p (H) = , H ∈ A   is injective. Particularly, if A is the collection of all paths of length 1 in G (That is, A = E(G)), then a Smarandachely harmonic graph is called Strongly harmonic graph. In this paper we show that all cycles, wheels, trees and grids are strongly harmonic graphs. Also, we give an upper bound and a lower bound for μ(n), the maximum number of edges in a strongly harmonic graph of order n.