We ask what kinds of sources Wikipedians value most and compare Wikipedia's stated policy on sources to what we observe in practice. We find that primary data sources developed by alternative publishers are both popular and persistent, despite policies that present such sources as inferior to scholarly secondary sources. We also find that Wikipedians make… (More)
In this paper, it is shown that the problem of deciding whether or not a geometric diagram in Euclidean Geometry is satisfiable is NP-hard and in PSPACE, and in fact has the same complexity as the satisfaction problem for a fragment of the exis-tential theory of the real numbers. The related problem of finding all of the possible (satisfiable) diagrams that… (More)
In several articles, John Mumma has presented a formal di-agrammatic system Eu meant to give an account of one way in which Euclid's use of diagrams in the Elements could be formalized. However, largely because of the way in which it tries to limit case analysis, this system ends up being inconsistent, as shown here. Eu also suffers from several other… (More)
The fabrication process for well-ordered nanopillars over large substrate areas, which are taller than 100nm, have aspect ratios as high as 10 : 1 and occur with a periodicity of less than 35nm is described. Various unique aspects of the materials and processing techniques enabled key features of the nanostructures: block copolymer lithography facilitated… (More)
This paper briefly describes CDEG 2.0, a computerized formal system for giving diagrammatic proofs in Euclidean geometry. This paper briefly describes the computer proof system CDEG, version 2.0. CDEG stands for " Computerized Diagrammatic Euclidean Geometry. " This computer proof system implements a diagrammatic formal system for giving diagram-based… (More)
The Macademia website promotes faculty collaboration and research by visualizing faculty research interests as a dynamic "constellation."Semantic similarity inference algorithms power the site's visualization, allowing users to spatially browse related research interests, and researchers who have those interests.
In a article in the Danner proved the full completeness of Shin's formal system for reasoning with Venn Diagrams. Their proof is eight pages long. This note gives a brief 5 line proof of this same result, using connections between diagrammatic and sentential representations.