G. E. Volovik, V. M. Pudalov · Journal of Experimental and Theoretical Physics Letters · 2016
We propose potential geometry for fabrication of the graphite sheets with atomically smooth edges. For such sheets with Bernal stacking, the electron–electron interaction and topology should cause sufficiently high density of states resulting in the high temperature of either spin ordering or superconducting pairing.
Cited by 3Open access
George R Peterson · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 2023
Graphite is joined to graphite by employing both fine molybdenum powder as the brazing material and an annealing step that together produce a virtually metal-free joint exhibiting properties similar to those found in the parent graphite. Molybdenum powder is placed between the faying surfaces of two graphite parts and melted to form molybdenum carbide. The joint area is thereafter subjected to an annealing operation which diffuses the carbide away from the joint and into the graphite parts. Graphite dissolved by the dispersed molybdenum carbide precipitates into the joint area, replacing the molybdenum carbide to provide a joint of virtually graphite.
Cited by 0Open access
W. Lougee · Bulletin of Miscellaneous Information (Royal Gardens Kew) · 2021
Cited by 0
State of Minnesota, Department of Natural Resources, Division of Parks and Recreation, Minnesota State Parks Cultural Resource Management Program staff · Open Context · 2006
Cited by 0
Tallinn University of Technology · DiSSCo · 2025
Cited by 0Open access
Beeloo, Rick · Zenodo (CERN European Organization for Nuclear Research) · 2024
See our GitHub for the latest version and more examples.Longest exact matches, LMEMS, in a collection of sequences Graphite starts with two graph files (from Cuttlefish) and a set of query identifiers. It then builds a suffix array of the queries along with other datastructures to speed up matching. Then each sequence (i.e "reference") is read from the graph file and mapped onto the Suffix array. Each mapping is an identical sequence between the queries and ref, also called Maximum Exact Matches (MEMs). Each time a MEM is found its length is compared to previously discovered MEMs to only retain the Longest MEM (LMEM). Usage Download the zip file and extract it. Move in the "Grahpite" folder. This is important as the code includes libasais which can only be found when the command below is ran from within the "Graphite" folder. To use graphite: julia main.jl -g test_data/phage_graph.cf_seq -s test_data/phage_graph.cf_seg -k 31 -o test_data/output.txt -q test_data/query.txt -g, the graph path file, when constructed using Cuttlefish the .cf_seq file. -s, the node sequence file, when constructed using Cuttlefish the .cf_seq file -k, the k-mer size used to build the graph (i.e. 31 nucleotides) -q, a file with query identifiers. These should match those in -g -o, the output file path Output The output file looks like: Reference:1_Sequence:MT952848.1 2 1 112 112 Reference:1_Sequence:MT952848.1 1 150 184 35 Reference:1_Sequence:MT952848.1 1 192 337 146 Reference:1_Sequence:MT952848.1 1 339 398 60 Reference:1_Sequence:MT952848.1 1 432 491 60 Which has five columns: The query identifier (as in -q) The reference index (1-based) The start position in nucleotides on the query sequence The end position in nucleotides on the query sequence The original MEM length* So for example, Reference:1_Sequence:MT952848.1 matches the first 112 nucleotides with the second reference in the file (test_data/phage_graph.cf_seq) *The original MEM size corresponding to the LMEM, to get the LMEM length use end-start+1
Cited by 0Open access
Marcus Paradies, Wolfgang Lehner, Christof Bornhövd · 2015
Graph traversals are a basic but fundamental ingredient for a variety of graph algorithms and graph-oriented queries. To achieve the best possible query performance, they need to be implemented at the core of a database management system that aims at storing, manipulating, and querying graph data. Increasingly, modern business applications demand native graph query and processing capabilities for enterprise-critical operations on data stored in relational database management systems. In this paper we propose an extensible graph traversal framework (GRAPHITE) as a central graph processing component on a common storage engine inside a relational database management system.
Cited by 29
Tallinn University of Technology · DiSSCo · 2025
Cited by 0Open access
Shirley Millidge · Oxford Art Online · 2003
Cited by 0
Massoud T. Simnad · Inorganic reactions and methods · 1999
Cited by 0
Woodhouse, Joe, Mulvihill, Michael · Sunderland Repository (University of Sunderland) · 2011
Graphite Edited by Michael Mulvihill and Joe Woodhouse Published 2011, Northumbria University, Newcastle upon Tyne ISBN 978-0-9565433-0-1
Cited by 0
Field Museum of Natural History · CARLI Digital Collections (Consortium of Academic and Research Libraries in Illinois) · 1934
N.W. Harris Public School Extension exhibit case illustrating the manufacture of graphite for pencils.
Cited by 0Open access
Justin Ponmany
Event: India|Photographer: Mohd. Ahmad Sabih|The video Graphite presents the grid in the form of a high school laboratory notebook. In its serene simplicity and minimalism, the underlying message is open to viewer's interpretation. Mentioned in the exhibition catalogue of 'Living Off The Grid' (2009), the symbol that is most often generated is the Swatika - a culturally loaded icon which references not just the ancient Indian motif for good luck, but also its misappropriation in Nazi Germany.
Cited by 0
Tallinn University of Technology · DiSSCo · 2026
Cited by 0Open access
Tallinn University of Technology · DiSSCo · 2025
Cited by 0Open access
Tallinn University of Technology · DiSSCo · 2025
Cited by 0Open access
Jan W. Gooch · 2007
Cited by 0
Tallinn University of Technology · DiSSCo · 2025
Cited by 0Open access
Tallinn University of Technology · DiSSCo · 2025
Cited by 0Open access
Tallinn University of Technology · DiSSCo · 2025
Cited by 0Open access