109 Matching Annotations
  1. Nov 2020
    1. I've spent the last 3.5 years building a platform for "information applications". The key observation which prompted this was that hierarchical file systems didn't work well for organising information within an organisation.However, hierarchy itself is still incredibly valuable. People think in terms of hierarchies - it's just that they think in terms of multiple hierarchies and an item will almost always belong in more than one place in those hierarchies.If you allow users to describe items in the way which makes sense to them, and then search and browse by any of the terms they've used, then you've eliminated almost all the frustrations of a file system. In my experience of working with people building complex information applications, you need: * deep hierarchy for classifying things * shallow hierarchy for noting relationships (eg "parent company") * multi-values for every single field * controlled values (in our case by linking to other items wherever possible) Unfortunately, none of this stuff is done well by existing database systems. Which was annoying, because I had to write an object store.

      Impressed by this comment. It foreshadows what Roam would become:

      • People think in terms of items belonging to multiple hierarchies
      • If you allow users to describe items in a way that makes sense to them and allow them to search and browse by any of the terms they've used, you've solved many of the problems of existing file systems

      What you need to build a complex information system is:

      • Deep hierarchies for classifying things (overlapping hierarchies should be possible)
      • Shallow hierarchies for noting relationships (Roam does this with a flat structure)
      • Multi-values for every single field
      • Controlled values (e.g. linking to other items when possible)
    1. Knowledge graphs combine characteristics of several data management paradigms: Database, because the data can be explored via structured queries; Graph, because they can be analyzed as any other network data structure; Knowledge base, because they bear formal semantics, which can be used to interpret the data and infer new facts.

      Characteristics / benefits of a knowledge graph

    1. The ontology data model can be applied to a set of individual facts to create a knowledge graph – a collection of entities, where the types and the relationships between them are expressed by nodes and edges between these nodes, By describing the structure of the knowledge in a domain, the ontology sets the stage for the knowledge graph to capture the data in it.

      How ontologies and knowledge graphs relate.

    1. An ontology is as a formal, explicit specification of a sharedconceptualization that is characterized by high semantic ex-pressiveness required for increased complexity [9]. Ontolog-ical representations allow semantic modeling of knowledge,and are therefore commonly used as knowledge bases in artifi-cial intelligence (AI) applications, for example, in the contextof knowledge-based systems. Application of an ontology asknowledge base facilitates validation of semantic relationshipsand derivation of conclusions from known facts for inference(i.e., reasoning) [9]

      Definition of an ontology

    2. A knowledge graph acquires and integrates infor-mation into an ontology and applies a reasonerto derive new knowledge.

      Definition of a Knowledge Graph

    1. Maybe your dbt models depend on source data tables that are populated by Stitch ingest, or by heavy transform jobs running in Spark. Maybe the tables your models build are depended on by analysts building reports in Mode, or ML engineers running experiments using Jupyter notebooks. Whether you’re a full-stack practitioner or a specialized platform team, you’ve probably felt the pain of trying to track dependencies across technologies and concerns. You need an orchestrator.Dagster lets you embed dbt into a wider orchestration graph.

      It can be common for [[data models]] to rely on other sources - where something like [[Dagster]] fits in - is allowing your dbt fit into a wider [[orchestration graph]]

  2. Oct 2020
    1. The needs: keyword enables executing jobs out-of-order, allowing you to implement a directed acyclic graph in your .gitlab-ci.yml. This lets you run some jobs without waiting for other ones, disregarding stage ordering so you can have multiple stages running concurrently.
    1. A spreadsheet may be represented as a directed acyclic graph, with each cell a vertex and an edge connected a cell when a formula references another cell. Other applications include scheduling, circuit design and Bayesian networks.
    1. the name of something and when you press the button to go to the link if it wasn't there it made the card

      This is a phenomenally important UX insight and affordance that has become a foundation of how all modern wiki-linking knowledge graph tools work today. Kudos to Ward for this!

    1. Long, H., correspondentEmailEmailBioEmailFollowEmail, H. L., Dam, rew V., Fowers, rew V. D. focusing on economic dataEmailEmailBioEmailFollowEmailAlyssa, visualization, A. F. reporter focusing on data, data, analysisEmailEmailBioEmailFollowEmailLeslie S. S. reporter focusing on, & storytellingEmailEmailBioEmailFollowEmail, multimedia. (n.d.). The covid-19 recession is the most unequal in modern U.S. history. Washington Post. Retrieved October 2, 2020, from https://www.washingtonpost.com/graphics/2020/business/coronavirus-recession-equality/

  3. Sep 2020
    1. So Memex was first and foremost an extension of human memory and the associative movements that the mind makes through information: a mechanical analogue to an already mechanical model of memory. Bush transferred this idea into information management; Memex was distinct from traditional forms of indexing not so much in its mechanism or content, but in the way it organised information based on association. The design did not spring from the ether, however; the first Memex design incorporates the technical architecture of the Rapid Selector and the methodology of the Analyzer — the machines Bush was assembling at the time.

      How much further would Bush have gone if he had known about graph theory? He is describing a graph database with nodes and edges and a graphical model itself is the key to the memex.

  4. Aug 2020
  5. Jul 2020
    1. Ruby has some really nice libraries for working with linked data. These libraries allow you to work with the data in both a graph and resource-oriented fashion, allowing a developer to use the techniques that best suit his or her use cases and skills.
    2. Another Ruby gem, Spira, allows graph data to be used as model objects
  6. Jun 2020
  7. May 2020
  8. Apr 2020
    1. This graph view is the easiest possible mental model for RDF and is often used in easy-to-understand visual explanations
  9. Mar 2020
    1. Not only are public transport datasets useful for benchmarking route planning systems, they are also highly useful for benchmarking geospatial [13, 14] and temporal [15, 16] RDF systems due to the intrinsic geospatial and temporal properties of public transport datasets. While synthetic dataset generators already exist in the geospatial and temporal domain [17, 18], no systems exist yet that focus on realism, and specifically look into the generation of public transport datasets. As such, the main topic that we address in this work, is solving the need for realistic public transport datasets with geospatial and temporal characteristics, so that they can be used to benchmark RDF data management and route planning systems. More specifically, we introduce a mimicking algorithm for generating realistic public transport data, which is the main contribution of this work.
  10. Dec 2019
    1. arborescence

      First sighting of word arborescence. I thought they were just doing that for fun, as a play on "tree", but I guess it's a real graph theory concept (https://en.wikipedia.org/wiki/Arborescence_(graph_theory)).

    1. branching

      I like this as a good alternative to the word arborescence. It seems to intuitively describe the concept using a more English-sounding word: it's talking about a specific branch/branching of the tree. Right?

  11. Sep 2019
    1. The problem with the annotation notion is that it's the first time that we consider a piece of data which is not merely a projection of data already present in the message store: it is out-of-band data that needs to be stored somewhere.

      could be same, schemaless datastore?

    2. many of the searches we want to do could be accomplished with a database that was nothing but a glorified set of hash tables

      Hello sql and cloure.set ns! ;P

    3. There are objects, sets of objects, and presentation tools. There is a presentation tool for each kind of object; and one for each kind of object set.

      very clojure-y mood, makes me think of clojure REBL (browser) which in turn is inspired by the smalltalk browser and was taken out of datomic (which is inspired by RDF, mentioned above!)

  12. Aug 2019
    1. After the success of MORE, he went on to develop a scripting language whose syntax (for both code and data) was an outline. Kind of like Lisp with open/close triangles instead of parens! It had one of the most comprehensive implementation of Apple Events client and server support of any Mac application, and was really useful for automating other Mac apps, earlier and in many ways better than AppleScript.

      Yes, lisp!

      This is my thinking as well i.e. if you could (a) keep parentheses but render them differently. But not going over board in basic view so it's still editable like text. AND also have a more graphical view.

    2. After the success of MORE, he went on to develop a scripting language whose syntax (for both code and data) was an outline.

      Lisp! ;P

    3. More was great because it had a well designed user interface and feature set with fluid "fahrvergnügen" that made it really easy to use with the keyboard as well as the mouse. It could also render your outlines as all kinds of nicely formatted and stylized charts and presentations. And it had a lot of powerful features you usually don't see in today's generic outliners.

      fahrvergnügen German for "driving-pleasure. Yes! ALSO This is kind of central, in two ways.

      A. you need to have good story for mouse only and keyboard only B. you need to have multi-modal rendering

    4. Engelbart also showed how to embed lists and outlines in maps:https://www.youtube.com/watch?v=yJDv-zdhzMY&t=15m39s

      Now this is interesting. Instead of normal map here they've had to use this simple sketch/graph. Just arrows etc. BUT There maybe an actual value in that kind of simplicity!

      Question worth asking here is why we have to see all the detail on the map always? Google may have different incentives than just showing you only essential data.

  13. May 2019
  14. Apr 2019
    1. Copying some network's feature often isn’t sufficient if you can’t also copy its graph, but if you can apply the feature to some unique graph that you earned some other way, it can be a defensible advantage.
    1. This means your application doesn’t have to infer data connections using foreign keys or out-of-band processing, such as MapReduce
    2. A graph database is an online database management system with Create, Read, Update and Delete (CRUD) operations working on a graph data model. Graph databases are generally built for use with online transaction processing (OLTP) systems
  15. Feb 2019
    1. I find it very interesting that the line for the gun control advocates and the gun rights advocates correlate so closely, it almost looks like a Rorschach test.

    2. wow that is a scary statistic, out of 33,594 gun related deaths almost 23,000 of them were suicide.

    3. that's insane to me that the US has more than double each of these other countries in gun related homicides.

    4. most of the gun related crimes in the US are committed with hand guns not riffles, that totally goes against the stereotype.

  16. Jan 2019
    1. Generation of diagrams and flowcharts from text in a similar manner as markdown. PlantUML equivalent in Javascript

  17. Dec 2018
  18. Sep 2018
    1. Whilespatial biases may contribute to these findings,asnodes belonging to the same module tend to be anatomically colocalized [7,8],they cannot explain these effects entirely [94,95].

      Very nice review. Please note the reference [94] (Pantazatos et al.) is misplaced because they did not argue that spatial biases cannot entirely explain the putative links between CGE and functional segregation. Instead, they argued there was insufficient evidence in the original Richiardi et al. study linking elevated CGE with resting state functional networks, and that spatial biases may in fact entirely account for their findings. To describe the debate/exchange more accurately, I would suggest replacing the below sentence

      “While spatial biases may contribute to these findings, as nodes belonging to the same module tend to be anatomically colocalized [7,8], they cannot explain these effects entirely [94,95].”

      with the below paragraph:

      “Spatial biases may contribute to these findings, as nodes belonging to the same module tend to be anatomically colocalized [7,8]. Pantazatos et al. argued that these findings are entirely explained by spatial biases [94]. They showed that elevated CGE, as defined in the original Richiardi et al. study, falls monotonically as longer distance edges are removed. Moreover, they showed that 1,000 sets of randomly spaced modules all have significantly high CGE when using the same null distribution defined in the original Richiardi et al. analyses. Therefore, elevated CGE is not specifically related to functional segregation as defined by resting state functional networks, which is in direct contradiction to the main conclusion of the original Richiardi et al. study. Since randomly placed modules do not align (spatially) with any distributed pattern of functional segregation, the finding of elevated CGE may instead be attributed entirely to anatomical colocalization of the nodes within each module. In their rebuttal to [94], Richiardi et al. argue spatial biases cannot explain their findings entirely [95]. However, the authors do not offer an explanation for significantly high CGE observed for randomly spaced sets of modules, other than to note that nodes tend to be closer on average compared to when modules are defined by resting state fMRI. Future work is required to dissociate the effects of spatially proximity on relationships between CGE and spatially distributed functional networks.”

  19. Mar 2018
  20. Oct 2017
  21. Jun 2017
    1. The vertices and edges of a graph, known as Atoms, are used to represent not only "data", but also "procedures"; thus, many graphs are executable programs as well as data structures.

      Rohan indicated that procedures are also part of the graph. let us find out why.

  22. Apr 2017
    1. Two people can have one conversation. Three people have four unique conversation groups (three different two-person conversations and a fourth conversation between all three as a group). Five people have 26. Twenty people have 1,048,554.

      what's the equation for that?

  23. Feb 2017
  24. Sep 2016
  25. Aug 2015
    1. In this scheme, if a sub-ject is related to multiple objects by the same prop-erty, then each distinct value is listed in a successiverow in the table for that property

      Sound like [Apache CouchDB]'s map/reduce output to anyone else?