<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (Vaguery)</title>
    <link>https://pinboard.in/u:Vaguery/public/</link>
    <description>recent bookmarks from Vaguery</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://arxiv.org/abs/1201.4089"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2403.15297"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1906.01478"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2012.05208"/>
	<rdf:li rdf:resource="https://github.com/noprompt/meander"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2103.10228"/>
	<rdf:li rdf:resource="https://www.theatlantic.com/science/archive/2019/01/how-lichens-explain-and-re-explain-world/580681/"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2006.09437"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2004.14999"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2003.02320"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1808.07202"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1904.07242"/>
	<rdf:li rdf:resource="https://link.springer.com/chapter/10.1007/978-3-030-15719-7_31"/>
	<rdf:li rdf:resource="https://community.ebay.com/t5/Selling/Gather-your-Item-Specifics-before-the-Category-changes/m-p/29837705#M1423669"/>
	<rdf:li rdf:resource="http://www.themathcitadel.com/2018/09/07/the-hathlor-classification-system/"/>
	<rdf:li rdf:resource="https://www.quantamagazine.org/with-food-webs-jennifer-dunne-puts-humans-back-into-ecology-20190321/"/>
	<rdf:li rdf:resource="https://blog.acolyer.org/2019/01/25/programming-paradigms-for-dummies-what-every-programmer-should-know/"/>
	<rdf:li rdf:resource="https://blog.acolyer.org/2018/09/21/same-different-problems-strain-convolutional-neural-networks/"/>
	<rdf:li rdf:resource="http://geepawhill.org/?p=237"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1705.08429"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1610.01983"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1608.00771"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1512.04234"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1001.2203"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1609.05524"/>
	<rdf:li rdf:resource="http://search.arxiv.org:8081/paper.jsp?r=1611.03398&amp;qid=1491475924245ler_nCnN_397128995&amp;qs=%22magic+square%22&amp;byDate=1"/>
	<rdf:li rdf:resource="http://understandingsociety.blogspot.com/2016/11/delanda-on-historical-ontology.html"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1610.07978"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1510.08808"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1406.7331"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1403.2194"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1505.04112"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1405.5598"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1503.00279"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1412.4847"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1412.6082"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1408.1110"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1409.1307"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1410.4258"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1312.5914"/>
	<rdf:li rdf:resource="http://dreamsongs.com/Files/Incommensurability.pdf#page=1&amp;zoom=auto,0,792"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1401.3864"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1309.5009"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1401.3885"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1308.4206"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1212.4522"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1309.2981"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1110.4499"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1306.5577"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1201.4089"/>
	<rdf:li rdf:resource="http://ontology.buffalo.edu/smith/articles/fiat.htm"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1212.5389"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1211.1144"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1301.3876"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1302.1554"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1211.3497"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1207.4708"/>
	<rdf:li rdf:resource="http://tapestryjava.blogspot.se/2012/07/you-cannot-correctly-represent-change.html"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1206.3421"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1206.3520"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1206.3279"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1204.6391"/>
	<rdf:li rdf:resource="http://ecologywithoutnature.blogspot.com/p/ooo-for-beginners.html"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1105.6001"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1006.5731"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1007.3794"/>
	<rdf:li rdf:resource="http://edgeofthewest.wordpress.com/2010/03/04/lessons-of-history-2/"/>
	<rdf:li rdf:resource="http://www.loc.gov/cds/FRBR.html"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://arxiv.org/abs/1201.4089">
    <title>[1201.4089] A Description Logic Primer</title>
    <dc:date>2025-10-25T14:31:38+00:00</dc:date>
    <link>https://arxiv.org/abs/1201.4089</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[This paper provides a self-contained first introduction to description logics (DLs). The main concepts and features are explained with examples before syntax and semantics of the DL SROIQ are defined in detail. Additional sections review light-weight DL languages, discuss the relationship to the Web Ontology Language OWL and give pointers to further reading.
]]></description>
<dc:subject>description-logics ontology formal-languages to-understand to-write-about consider:stochastic-syntax</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:765b2dac806a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:description-logics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:formal-languages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:stochastic-syntax"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2403.15297">
    <title>[2403.15297] Sphere Neural-Networks for Rational Reasoning</title>
    <dc:date>2025-08-22T12:52:30+00:00</dc:date>
    <link>https://arxiv.org/abs/2403.15297</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The success of Large Language Models (LLMs), e.g., ChatGPT, is witnessed by their planetary popularity, their capability of human-like communication, and also by their steadily improved reasoning performance. However, it remains unclear whether LLMs reason. It is an open problem how traditional neural networks can be qualitatively extended to go beyond the statistic paradigm and achieve high-level cognition. Here, we present a novel qualitative extension by generalising computational building blocks from vectors to spheres. We propose Sphere Neural Networks (SphNNs) for human-like reasoning through model construction and inspection, and develop SphNN for syllogistic reasoning, a microcosm of human rationality. SphNN is a hierarchical neuro-symbolic Kolmogorov-Arnold geometric GNN, and uses a neuro-symbolic transition map of neighbourhood spatial relations to transform the current sphere configuration towards the target. SphNN is the first neural model that can determine the validity of long-chained syllogistic reasoning in one epoch without training data, with the worst computational complexity of O(N). SphNN can evolve into various types of reasoning, such as spatio-temporal reasoning, logical reasoning with negation and disjunction, event reasoning, neuro-symbolic unification, and humour understanding (the highest level of cognition). All these suggest a new kind of Herbert A. Simon's scissors with two neural blades. SphNNs will tremendously enhance interdisciplinary collaborations to develop the two neural blades and realise deterministic neural reasoning and human-bounded rationality and elevate LLMs to reliable psychological AI. This work suggests that the non-zero radii of spheres are the missing components that prevent traditional deep-learning systems from reaching the realm of rational reasoning and cause LLMs to be trapped in the swamp of hallucination.
]]></description>
<dc:subject>neural-networks representation formal-logic ontology to-understand consider:classic-AI consider:member-of-networks rationality machine-learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:336f8efa870b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:formal-logic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:classic-AI"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:member-of-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rationality"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1906.01478">
    <title>[1906.01478] What do AI algorithms actually learn? - On false structures in deep learning</title>
    <dc:date>2021-07-12T23:51:46+00:00</dc:date>
    <link>https://arxiv.org/abs/1906.01478</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[There are two big unsolved mathematical questions in artificial intelligence (AI): (1) Why is deep learning so successful in classification problems and (2) why are neural nets based on deep learning at the same time universally unstable, where the instabilities make the networks vulnerable to adversarial attacks. We present a solution to these questions that can be summed up in two words; false structures. Indeed, deep learning does not learn the original structures that humans use when recognising images (cats have whiskers, paws, fur, pointy ears, etc), but rather different false structures that correlate with the original structure and hence yield the success. However, the false structure, unlike the original structure, is unstable. The false structure is simpler than the original structure, hence easier to learn with less data and the numerical algorithm used in the training will more easily converge to the neural network that captures the false structure. We formally define the concept of false structures and formulate the solution as a conjecture. Given that trained neural networks always are computed with approximations, this conjecture can only be established through a combination of theoretical and computational results similar to how one establishes a postulate in theoretical physics (e.g. the speed of light is constant). Establishing the conjecture fully will require a vast research program characterising the false structures. We provide the foundations for such a program establishing the existence of the false structures in practice. Finally, we discuss the far reaching consequences the existence of the false structures has on state-of-the-art AI and Smale's 18th problem.
]]></description>
<dc:subject>machine-learning ontology philosophy-of-engineering performance-measure internal-state rather-interesting to-write-about experiment</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:83f66d016382/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:internal-state"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:experiment"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2012.05208">
    <title>[2012.05208] On the Binding Problem in Artificial Neural Networks</title>
    <dc:date>2021-05-19T10:58:09+00:00</dc:date>
    <link>https://arxiv.org/abs/2012.05208</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Contemporary neural networks still fall short of human-level generalization, which extends far beyond our direct experiences. In this paper, we argue that the underlying cause for this shortcoming is their inability to dynamically and flexibly bind information that is distributed throughout the network. This binding problem affects their capacity to acquire a compositional understanding of the world in terms of symbol-like entities (like objects), which is crucial for generalizing in predictable and systematic ways. To address this issue, we propose a unifying framework that revolves around forming meaningful entities from unstructured sensory inputs (segregation), maintaining this separation of information at a representational level (representation), and using these entities to construct new inferences, predictions, and behaviors (composition). Our analysis draws inspiration from a wealth of research in neuroscience and cognitive psychology, and surveys relevant mechanisms from the machine learning literature, to help identify a combination of inductive biases that allow symbolic information processing to emerge naturally in neural networks. We believe that a compositional approach to AI, in terms of grounded symbol-like representations, is of fundamental importance for realizing human-level generalization, and we hope that this paper may contribute towards that goal as a reference and inspiration.
]]></description>
<dc:subject>neural-networks machine-learning general-AI ontology philosophy-of-engineering representation linguistics individuation do-what-I-want-not-what-I-say</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:f39c84d7ea7c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:general-AI"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:linguistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:individuation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:do-what-I-want-not-what-I-say"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://github.com/noprompt/meander">
    <title>noprompt/meander: Tools for transparent data transformation</title>
    <dc:date>2021-05-18T22:15:46+00:00</dc:date>
    <link>https://github.com/noprompt/meander</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Meander is a Clojure/ClojureScript library that empowers you to write transparent data transformation code that allows you to plainly see the input and output of these transformations.

The latest version of the library can be found at the following link.

]]></description>
<dc:subject>clojure libraries data-analysis formal-languages rather-interesting no-really to-understand ontology type-theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:7d70cfe8dddd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:clojure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:libraries"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:data-analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:formal-languages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:no-really"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:type-theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2103.10228">
    <title>[2103.10228] Colored HOMFLY-PT for hybrid weaving knot $hat{W}_{3}(m,n)$</title>
    <dc:date>2021-05-07T10:06:47+00:00</dc:date>
    <link>https://arxiv.org/abs/2103.10228</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Weaving knots W(p,n) of type (p,n) denote an infinite family of hyperbolic knots which have not been addressed by the knot theorists as yet. Unlike the well-known (p,n) torus knots, we do not have a closed-form expression for HOMFLY-PT and the colored HOMFLY-PT for W(p,n). In this paper, we confine to a hybrid generalization of W(3,n) which we denote as Ŵ3(m,n) and obtain a closed-form expression for HOMFLY-PT using the Reshitikhin and Turaev method involving -matrices. Further, we also compute [r]-colored HOMFLY-PT for W(3,n). Surprisingly, we observe that trace of the product of two dimensional ̂-matrices can be written in terms of an infinite family of Laurent polynomials n,t[q] whose absolute coefficients has an interesting relation to the Fibonacci numbers n. We also computed reformulated invariants and the BPS integers in the context of topological strings. From our analysis, we propose that certain refined BPS integers for weaving knot W(3,n) can be explicitly derived from the coefficients of Chebyshev polynomials of the first kind.
]]></description>
<dc:subject>knot-theory rather-interesting classification looking-to-see ontology nudge-targets feature-construction</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:6658473e7fc1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:knot-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:feature-construction"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.theatlantic.com/science/archive/2019/01/how-lichens-explain-and-re-explain-world/580681/">
    <title>How Lichens Explain (And Re-explain) the World - The Atlantic</title>
    <dc:date>2021-04-09T15:38:20+00:00</dc:date>
    <link>https://www.theatlantic.com/science/archive/2019/01/how-lichens-explain-and-re-explain-world/580681/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[“Language matters a lot when dealing with these organisms,” Spribille, now at the University of Alberta, adds. “If we set up our language so that our definition of a lichen is fixed, and these other elements are extrinsic, we’re setting ourselves up to find that they’re extrinsic.” He thinks that researchers should move away from “the imperative of classification” and the compulsion to shoehorn organisms into fixed buckets. He suspects that the relationships between all the components of a lichen are probably highly contextual—beneficial in some settings, neutral or harmful in others.  

]]></description>
<dc:subject>biology online-learning ontology ecology looking-to-see rather-interesting symbiosis define-your-terms philosophy-of-science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:179603cbfb86/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:online-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ecology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:symbiosis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:define-your-terms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2006.09437">
    <title>[2006.09437] A Study of Compositional Generalization in Neural Models</title>
    <dc:date>2021-03-12T14:43:14+00:00</dc:date>
    <link>https://arxiv.org/abs/2006.09437</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Compositional and relational learning is a hallmark of human intelligence, but one which presents challenges for neural models. One difficulty in the development of such models is the lack of benchmarks with clear compositional and relational task structure on which to systematically evaluate them. In this paper, we introduce an environment called ConceptWorld, which enables the generation of images from compositional and relational concepts, defined using a logical domain specific language. We use it to generate images for a variety of compositional structures: 2x2 squares, pentominoes, sequences, scenes involving these objects, and other more complex concepts. We perform experiments to test the ability of standard neural architectures to generalize on relations with compositional arguments as the compositional depth of those arguments increases and under substitution. We compare standard neural networks such as MLP, CNN and ResNet, as well as state-of-the-art relational networks including WReN and PrediNet in a multi-class image classification setting. For simple problems, all models generalize well to close concepts but struggle with longer compositional chains. For more complex tests involving substitutivity, all models struggle, even with short chains. In highlighting these difficulties and providing an environment for further experimentation, we hope to encourage the development of models which are able to generalize effectively in compositional, relational domains.
]]></description>
<dc:subject>ontology generalization artificial-intelligence rather-interesting neural-networks composability to-write-about consider:genetic-programming consider:classifiers-more-broadly consider:multitask-learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:c7254c4bce0d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:generalization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:artificial-intelligence"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:composability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:genetic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:classifiers-more-broadly"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:multitask-learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2004.14999">
    <title>[2004.14999] A Matter of Framing: The Impact of Linguistic Formalism on Probing Results</title>
    <dc:date>2020-09-02T11:37:38+00:00</dc:date>
    <link>https://arxiv.org/abs/2004.14999</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Deep pre-trained contextualized encoders like BERT (Delvin et al., 2019) demonstrate remarkable performance on a range of downstream tasks. A recent line of research in probing investigates the linguistic knowledge implicitly learned by these models during pre-training. While most work in probing operates on the task level, linguistic tasks are rarely uniform and can be represented in a variety of formalisms. Any linguistics-based probing study thereby inevitably commits to the formalism used to annotate the underlying data. Can the choice of formalism affect probing results? To investigate, we conduct an in-depth cross-formalism layer probing study in role semantics. We find linguistically meaningful differences in the encoding of semantic role- and proto-role information by BERT depending on the formalism and demonstrate that layer probing can detect subtle differences between the implementations of the same linguistic formalism. Our results suggest that linguistic formalism is an important dimension in probing studies, along with the commonly used cross-task and cross-lingual experimental settings.
]]></description>
<dc:subject>natural-language-processing deep-learning looking-to-see experiment rather-interesting reverse-engineering ontology define-your-terms feature-construction</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:2d972df4e4b9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:natural-language-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:experiment"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:reverse-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:define-your-terms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:feature-construction"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2003.02320">
    <title>[2003.02320] Knowledge Graphs</title>
    <dc:date>2020-03-19T10:18:17+00:00</dc:date>
    <link>https://arxiv.org/abs/2003.02320</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In this paper we provide a comprehensive introduction to knowledge graphs, which have recently garnered significant attention from both industry and academia in scenarios that require exploiting diverse, dynamic, large-scale collections of data. After a general introduction, we motivate and contrast various graph-based data models and query languages that are used for knowledge graphs. We discuss the roles of schema, identity, and context in knowledge graphs. We explain how knowledge can be represented and extracted using a combination of deductive and inductive techniques. We summarise methods for the creation, enrichment, quality assessment, refinement, and publication of knowledge graphs. We provide an overview of prominent open knowledge graphs and enterprise knowledge graphs, their applications, and how they use the aforementioned techniques. We conclude with high-level future research directions for knowledge graphs.
]]></description>
<dc:subject>representation data-structures ontology to-understand to-write-about to-learn software-development-is-not-programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:7f34c05bc6ff/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:data-structures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-learn"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:software-development-is-not-programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1808.07202">
    <title>[1808.07202] A Survey on Food Computing</title>
    <dc:date>2020-01-10T12:52:00+00:00</dc:date>
    <link>https://arxiv.org/abs/1808.07202</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Food is very essential for human life and it is fundamental to the human experience. Food-related study may support multifarious applications and services, such as guiding the human behavior, improving the human health and understanding the culinary culture. With the rapid development of social networks, mobile networks, and Internet of Things (IoT), people commonly upload, share, and record food images, recipes, cooking videos, and food diaries, leading to large-scale food data. Large-scale food data offers rich knowledge about food and can help tackle many central issues of human society. Therefore, it is time to group several disparate issues related to food computing. Food computing acquires and analyzes heterogenous food data from disparate sources for perception, recognition, retrieval, recommendation, and monitoring of food. In food computing, computational approaches are applied to address food related issues in medicine, biology, gastronomy and agronomy. Both large-scale food data and recent breakthroughs in computer science are transforming the way we analyze food data. Therefore, vast amounts of work has been conducted in the food area, targeting different food-oriented tasks and applications. However, there are very few systematic reviews, which shape this area well and provide a comprehensive and in-depth summary of current efforts or detail open problems in this area. In this paper, we formalize food computing and present such a comprehensive overview of various emerging concepts, methods, and tasks. We summarize key challenges and future directions ahead for food computing. This is the first comprehensive survey that targets the study of computing technology for the food area and also offers a collection of research studies and technologies to benefit researchers and practitioners working in different food-related fields.
]]></description>
<dc:subject>representation domain-specific rather-interesting rather-odd engineering-criticism review machine-learning ontology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:f2ea51d27f10/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:domain-specific"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-odd"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-criticism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:review"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1904.07242">
    <title>[1904.07242] Topological phases without crystalline counterparts</title>
    <dc:date>2019-06-24T11:11:02+00:00</dc:date>
    <link>https://arxiv.org/abs/1904.07242</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Recent years saw the complete classification of topological band structures, revealing an abundance of topological crystalline insulators. Here we theoretically demonstrate the existence of topological materials beyond this framework, protected by quasicrystalline symmetries. We construct a higher-order topological phase protected by a point group symmetry that is impossible in any crystalline system. Our tight-binding model describes a superconductor on a quasicrystalline Ammann-Beenker tiling which hosts localized Majorana zero modes at the corners of an octagonal sample. The Majorana modes are protected by particle-hole symmetry and by the combination of an 8-fold rotation and in-plane reflection symmetry. We find a bulk topological invariant associated with the presence of these zero modes, and show that they are robust against large symmetry preserving deformations, as long as the bulk remains gapped. The nontrivial bulk topology of this phase falls outside all currently known classification schemes.]]></description>
<dc:subject>materials-science simulation classification ontology rather-interesting tiling symmetry out-of-the-box define-your-terms topology to-understand</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:4ad654213c8f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:tiling"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:symmetry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:out-of-the-box"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:define-your-terms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:topology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://link.springer.com/chapter/10.1007/978-3-030-15719-7_31">
    <title>Rethinking ‘Advanced Search’: A New Approach to Complex Query Formulation | SpringerLink</title>
    <dc:date>2019-06-15T10:42:52+00:00</dc:date>
    <link>https://link.springer.com/chapter/10.1007/978-3-030-15719-7_31</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Knowledge workers such as patent agents, recruiters and media monitoring professionals undertake work tasks where search forms a core part of their duties. In these instances, the search task often involves the formulation of complex queries expressed as Boolean strings. However, creating effective Boolean queries remains an ongoing challenge, often compromised by errors and inefficiencies. In this demo paper, we present a new approach to query formulation in which concepts are expressed on a two-dimensional canvas and relationships are articulated using direct manipulation. This has the potential to eliminate many sources of error, makes the query semantics more transparent, and offers new opportunities for query refinement and optimisation.

]]></description>
<dc:subject>via:mymarkup get-at:researchgate search user-interface user-experience ontology usability rather-interesting representation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:890350f05324/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:via:mymarkup"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:get-at:researchgate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:search"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:user-interface"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:user-experience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:usability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://community.ebay.com/t5/Selling/Gather-your-Item-Specifics-before-the-Category-changes/m-p/29837705#M1423669">
    <title>Gather your Item Specifics before the Category cha... - The eBay Community</title>
    <dc:date>2019-06-09T17:49:31+00:00</dc:date>
    <link>https://community.ebay.com/t5/Selling/Gather-your-Item-Specifics-before-the-Category-changes/m-p/29837705#M1423669</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[https://developer.ebay.com/tools/item-specifics]]></description>
<dc:subject>eBay bad-design fuckem ontology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:bfe75ef5acaf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:eBay"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:bad-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:fuckem"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.themathcitadel.com/2018/09/07/the-hathlor-classification-system/">
    <title>The Hathlor Classification System – The Math Citadel</title>
    <dc:date>2019-04-13T11:01:28+00:00</dc:date>
    <link>http://www.themathcitadel.com/2018/09/07/the-hathlor-classification-system/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Why Reinvent the Wheel?
As mentioned before, we felt that the current systems in use both omit useful information regarding the content of the works and add extra information a user doesn’t typically care about, such as the LCC’s cutter number. In addition, a researcher or browser may simply have a general idea of the types of things he would like a text to contain, but neither the DDC nor the LCC provides a simple way to search for such things. Ours provides a way to search via a simple regular expression query, returning a set of texts previously unknown to the user that fit the subjects, topics, and subtopics he seeks, particularly books that contain all he seeks. 

]]></description>
<dc:subject>classification ontology books libraries rather-interesting feature-selection</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d215e13d5061/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:books"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:libraries"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:feature-selection"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.quantamagazine.org/with-food-webs-jennifer-dunne-puts-humans-back-into-ecology-20190321/">
    <title>With Food Webs, Jennifer Dunne Puts Humans Back Into Ecology | Quanta Magazine</title>
    <dc:date>2019-03-29T13:01:07+00:00</dc:date>
    <link>https://www.quantamagazine.org/with-food-webs-jennifer-dunne-puts-humans-back-into-ecology-20190321/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In 2016 Dunne co-authored the first comprehensive, detailed food web that explicitly included humans. That paper looked at the Aleut people who inhabited Alaska’s Sanak Archipelago for thousands of years. Since then, she and other researchers have described food webs that include humans from other ecosystems, both past and present-day. While they built these food webs, Dunne and some of her ecologist and archaeologist colleagues also started brainstorming about other ways to explore how humans have interacted with ecosystems throughout history.

They arrived at the idea of a new kind of network: not a food web, but a web of use. Their working group, which first came together in early 2017, looks at six populations of preindustrial or nonindustrial humans, cataloging every way that people interacted with the species around them: pelts for clothing, wood for shelter, leaves for medicine and so on. To visualize the results, the researchers map a culture’s five or six most-used species onto a circular plot, along with a “taxonomy of uses.” The result resembles a thickly woven dreamcatcher.

]]></description>
<dc:subject>ecology complexology define-your-terms rather-interesting ontology seeing-the-data to-write-about the-mangle-in-practice the-docile-body-of-the-scientist seeing-as-a-feature nature-and-man-sittin-in-a-tree</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:c69e22eb600c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ecology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:complexology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:define-your-terms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:seeing-the-data"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:the-mangle-in-practice"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:the-docile-body-of-the-scientist"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:seeing-as-a-feature"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nature-and-man-sittin-in-a-tree"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://blog.acolyer.org/2019/01/25/programming-paradigms-for-dummies-what-every-programmer-should-know/">
    <title>Programming paradigms for dummies: what every programmer should know | the morning paper</title>
    <dc:date>2019-02-18T16:27:14+00:00</dc:date>
    <link>https://blog.acolyer.org/2019/01/25/programming-paradigms-for-dummies-what-every-programmer-should-know/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Programming paradigms are approaches based on a mathematical theory or particular set of principles, each paradigm supporting a set of concepts. Van Roy is a believer in multi-paradigm languages: solving a programming problem requires choosing the right concepts, and many problems require different sets of concepts for different parts. Moreover, many programs have to solve more than one problem! “A language should ideally support many concepts in a well-factored way, so that the programmer can choose the right concepts whenever they are needed without being encumbered by the others.” That makes intuitive sense, but in my view does also come with a potential downside: the reader of a program written in such a language needs to be fluent in multiple paradigms and how they interact. (Mitigating this is probably what Van Roy had in mind with the ‘well-factored’ qualification: a true multi-paradigm language should avoid cross-paradigm interference, not just support a rag-bag of concepts). As Van Roy himself says later on when discussing state: “The point is to pick a paradigm with just the right concepts. Too few and programs become complicated. Too many and reasoning becomes complicated.“

]]></description>
<dc:subject>have-read to-cite programming-language classification rather-interesting ontology ReQ consider:robustness</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:054ff99cdeaf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:have-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-cite"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:programming-language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ReQ"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:robustness"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://blog.acolyer.org/2018/09/21/same-different-problems-strain-convolutional-neural-networks/">
    <title>Same-different problems strain convolutional neural networks | the morning paper</title>
    <dc:date>2018-09-29T12:03:48+00:00</dc:date>
    <link>https://blog.acolyer.org/2018/09/21/same-different-problems-strain-convolutional-neural-networks/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Digging deeper, when learning did occur in SD, increasing item size never strained performance. But increasing the overall image size, or increasing the number of items did. (Gray bars in the above figures indicate the number of trials in which learning failed). The results suggest that straining is not simply a direct outcome of an increase in image variability. Using CNNs with more than twice the number of kernels (wide), or twice as many layers (deep) did not change the observed trend.

]]></description>
<dc:subject>neural-networks representation problem-solving rather-interesting ontology generalization to-write-about nudge-targets consider:feature-discovery</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:f1f86ea3529a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:problem-solving"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:generalization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:feature-discovery"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://geepawhill.org/?p=237">
    <title>Idols of the Schema: Ignoring Data While Overvaluing Ideas | GeePawHill.Org</title>
    <dc:date>2017-09-20T12:51:00+00:00</dc:date>
    <link>http://geepawhill.org/?p=237</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Mike Hill on "Idols of the Schema"; good stuff

> in comparsion w/free-roaming ideas, bound ideas are muddy complex beasts. hard to draw. hard to consider. hard to flex & fit.]]></description>
<dc:subject>philosophy philosophy-of-engineering define-your-terms to-write-about cognition ontology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:ca2180a0b14e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:define-your-terms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cognition"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1705.08429">
    <title>[1705.08429] The chemical bond as an emergent phenomenon</title>
    <dc:date>2017-06-17T11:59:52+00:00</dc:date>
    <link>https://arxiv.org/abs/1705.08429</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We first argue that the covalent bond and the various closed-shell interactions can be thought of as symmetry broken versions of one and the same interaction, viz., the multi-center bond. We use specially chosen molecular units to show that the symmetry breaking is controlled by density and electronegativity variation. We show that the bond order changes with bond deformation but in a step-like fashion, regions of near constancy separated by electronic localization transitions. These will often cause displacive transitions as well so that the bond strength, order, and length are established self-consistently. We further argue on the inherent relation of the covalent, closed-shell, and multi-center interactions with ionic and metallic bonding. All of these interactions can be viewed as distinct sectors on a phase diagram with density and electronegativity variation as control variables; the ionic and covalent/secondary sectors are associated with on-site and bond-order charge density wave respectively, the metallic sectorwith an electronic fluid. While displaying a contiguity at low densities, the metallic and ionic interactions represent distinct phases separated by discontinuous transitions at sufficiently high densities. Multi-center interactions emerge as a hybrid of the metallic and ionic bond that results from spatial coexistence of delocalized and localized electrons. In the present description, the issue of the stability of a compound is that of mutual miscibility of electronic fluids with distinct degrees of electron localization, supra-atomic ordering in complex inorganic compounds comes about naturally. The notions of electronic localization advanced hereby suggest a high throughput, automated procedure for screening candidate compounds and structures with regard to stability, without the need for computationally costly geometric optimization.
]]></description>
<dc:subject>chemistry rather-interesting theoretical-chemistry emergence experiment to-write-about philosophy-of-science ontology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d6adbe4d72ff/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:chemistry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:theoretical-chemistry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:emergence"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:experiment"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1610.01983">
    <title>[1610.01983] Driving in the Matrix: Can Virtual Worlds Replace Human-Generated Annotations for Real World Tasks?</title>
    <dc:date>2017-05-10T11:15:51+00:00</dc:date>
    <link>https://arxiv.org/abs/1610.01983</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Deep learning has rapidly transformed the state of the art algorithms used to address a variety of problems in computer vision and robotics. These breakthroughs have relied upon massive amounts of human annotated training data. This time consuming process has begun impeding the progress of these deep learning efforts. This paper describes a method to incorporate photo-realistic computer images from a simulation engine to rapidly generate annotated data that can be used for the training of machine learning algorithms. We demonstrate that a state of the art architecture, which is trained only using these synthetic annotations, performs better than the identical architecture trained on human annotated real-world data, when tested on the KITTI data set for vehicle detection. By training machine learning algorithms on a rich virtual world, real objects in real scenes can be learned and classified using synthetic data. This approach offers the possibility of accelerating deep learning's application to sensor-based classification problems like those that appear in self-driving cars. The source code and data to train and validate the networks described in this paper are made available for researchers.
]]></description>
<dc:subject>simulation engineering-design ontology approximation training to-write-about consider:stress-testing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:a46a7f9e2529/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:training"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:stress-testing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1608.00771">
    <title>[1608.00771] Smart Contract Templates: foundations, design landscape and research directions</title>
    <dc:date>2017-05-07T12:21:29+00:00</dc:date>
    <link>https://arxiv.org/abs/1608.00771</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In this position paper, we consider some foundational topics regarding smart contracts (such as terminology, automation, enforceability, and semantics) and define a smart contract as an automatable and enforceable agreement. We explore a simple semantic framework for smart contracts, covering both operational and non-operational aspects, and describe templates and agreements for legally-enforceable smart contracts, based on legal documents. Building upon the Ricardian Contract, we identify operational parameters in the legal documents and use these to connect legal agreements to standardised code. We also explore the design landscape, including increasing sophistication of parameters, increasing use of common standardised code, and long-term research.
]]></description>
<dc:subject>law contracts to-write-about formalization ontology software-development-is-not-programming law-is-not-code-writing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:289abaa3c03d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:law"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:contracts"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:formalization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:software-development-is-not-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:law-is-not-code-writing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1512.04234">
    <title>[1512.04234] Beta-representations of 0 and Pisot numbers</title>
    <dc:date>2017-04-29T13:09:10+00:00</dc:date>
    <link>https://arxiv.org/abs/1512.04234</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Let β>1, d a positive integer, and
Zβ,d={z1z2⋯∣∑i≥1ziβ−i=0,zi∈{−d,…,d}}
be the set of infinite words having value 0 in base β on the alphabet {−d,…,d}. Based on a recent result of Feng on spectra of numbers, we prove that if the set Zβ,⌈β⌉−1 is recognizable by a finite B\"uchi automaton then β is a Pisot number. As a consequence of previous results, the set Zβ,d is recognizable by a finite B\"uchi automaton for every positive integer d if and only if Zβ,d is recognizable by a finite B\"uchi automaton for one d≥⌈β⌉−1. These conditions are equivalent to the fact that β is a Pisot number. The bound ⌈β⌉−1 cannot be further reduced.]]></description>
<dc:subject>number-theory representation define-your-terms rather-interesting ontology nudge-targets consider:novelty-search consider:performance-measures</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e3a9a63b1cd9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:number-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:define-your-terms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:novelty-search"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:performance-measures"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1001.2203">
    <title>[1001.2203] A fractal version of the pinwheel tiling</title>
    <dc:date>2017-04-29T11:15:25+00:00</dc:date>
    <link>https://arxiv.org/abs/1001.2203</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We introduce a fractal version of the pinwheel substitution tiling. There are thirteen basic prototiles, all of which have fractal boundaries. These tiles, along with their reflections and rotations, create a tiling space which is mutually locally derivable from the pinwheel tiling space. Interesting rotational properties, symmetries, and relative tile frequency are discussed for the tiling space associated with the fractal pinwheel tiling.
]]></description>
<dc:subject>tiling fractals self-similarity rather-interesting to-write-about representation ontology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:b0bbb4b64d14/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:tiling"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:fractals"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:self-similarity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1609.05524">
    <title>[1609.05524] Principled Option Learning in Markov Decision Processes</title>
    <dc:date>2017-04-17T11:33:57+00:00</dc:date>
    <link>https://arxiv.org/abs/1609.05524</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[It is well known that options can make planning more efficient, among their many benefits. Thus far, algorithms for autonomously discovering a set of useful options were heuristic. Naturally, a principled way of finding a set of useful options may be more promising and insightful. In this paper we suggest a mathematical characterization of good sets of options using tools from information theory. This characterization enables us to find conditions for a set of options to be optimal and an algorithm that outputs a useful set of options and illustrate the proposed algorithm in simulation.
]]></description>
<dc:subject>machine-learning tqsk-decoomposition feature-construction feature-discovery planning ontology to-write-about consider:evolutionary-algorithms consider:exploration-vs-exploitation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:5db91839a328/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:tqsk-decoomposition"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:feature-construction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:feature-discovery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:planning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:evolutionary-algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:exploration-vs-exploitation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://search.arxiv.org:8081/paper.jsp?r=1611.03398&amp;qid=1491475924245ler_nCnN_397128995&amp;qs=%22magic+square%22&amp;byDate=1">
    <title>[1611.03398] XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems</title>
    <dc:date>2017-04-17T09:10:25+00:00</dc:date>
    <link>http://search.arxiv.org:8081/paper.jsp?r=1611.03398&amp;qid=1491475924245ler_nCnN_397128995&amp;qs=%22magic+square%22&amp;byDate=1</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated representations of combinatorial constrained problems. This new format is able to deal with mono/multi optimization, many types of variables, cost functions, reification, views, annotations, variable quantification, distributed, probabilistic and qualitative reasoning. The new format is made compact, highly readable, and rather easy to parse. Interestingly, it captures the structure of the problem models, through the possibilities of declaring arrays of variables, and identifying syntactic and semantic groups of constraints. The number of constraints is kept under control by introducing a limited set of basic constraint forms, and producing almost automatically some of their variations through lifting, restriction, sliding, logical combination and relaxation mechanisms. As a result, XCSP3 encompasses practically all constraints that can be found in major constraint solvers developed by the CP community. A website, which is developed conjointly with the format, contains many models and series of instances. The user can make sophisticated queries for selecting instances from very precise criteria. The objective of XCSP3 is to ease the effort required to test and compare different algorithms by providing a common test-bed of combinatorial constrained instances.
]]></description>
<dc:subject>constraint-satisfaction representation rather-interesting to-write-about operations-research benchmarking XML ontology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:6f5e295e3eb2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:constraint-satisfaction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:operations-research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:benchmarking"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:XML"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://understandingsociety.blogspot.com/2016/11/delanda-on-historical-ontology.html">
    <title>Understanding Society: DeLanda on historical ontology</title>
    <dc:date>2016-12-27T12:11:40+00:00</dc:date>
    <link>http://understandingsociety.blogspot.com/2016/11/delanda-on-historical-ontology.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[A primary reason for thinking that assemblage theory is important is the fact that it offers new ways of thinking about social ontology. Instead of thinking of the social world as consisting of fixed entities and properties, we are invited to think of it as consisting of fluid agglomerations of diverse and heterogeneous processes. Manuel DeLanda's recent book Assemblage Theory sheds new light on some of the complexities of this theory.

Particularly important is the question of how to think about the reality of large historical structures and conditions. What is "capitalism" or "the modern state" or "the corporation"? Are these temporally extended but unified things? Or should they be understood in different terms altogether? Assemblage theory suggests a very different approach. Here is an astute description by DeLanda of historical ontology with respect to the historical imagination of Fernand Braudel:
]]></description>
<dc:subject>philosophy social-psychology ontology rather-interesting to-read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:f68dfc2e270c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:social-psychology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1610.07978">
    <title>[1610.07978] Dependent Types in Haskell: Theory and Practice</title>
    <dc:date>2016-12-18T16:43:41+00:00</dc:date>
    <link>https://arxiv.org/abs/1610.07978</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Haskell, as implemented in the Glasgow Haskell Compiler (GHC), has been adding new type-level programming features for some time. Many of these features---chiefly: generalized algebraic datatypes (GADTs), type families, kind polymorphism, and promoted datatypes---have brought Haskell to the doorstep of dependent types. Many dependently typed programs can even currently be encoded, but often the constructions are painful. 
In this dissertation, I describe Dependent Haskell, which supports full dependent types via a backward-compatible extension to today's Haskell. An important contribution of this work is an implementation, in GHC, of a portion of Dependent Haskell, with the rest to follow. The features I have implemented are already released, in GHC 8.0. This dissertation contains several practical examples of Dependent Haskell code, a full description of the differences between Dependent Haskell and today's Haskell, a novel type-safe dependently typed lambda-calculus (called Pico) suitable for use as an intermediate language for compiling Dependent Haskell, and a type inference and elaboration algorithm, Bake, that translates Dependent Haskell to type-correct Pico.
]]></description>
<dc:subject>programming-language Haskell type-systems computer-science ontology rather-interesting thesis to-understand</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:2099e9c46d93/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:programming-language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:type-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:thesis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1510.08808">
    <title>[1510.08808] Scientific Pluralism: the battle of High Temperature Superconductivity</title>
    <dc:date>2015-11-09T12:39:20+00:00</dc:date>
    <link>http://arxiv.org/abs/1510.08808</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The early development of conflicting theories (i.e. one aspect of scientific pluralism) about the microscopic mechanism of High Temperature Superconductivity is described. The biographical roots of this diversity are stressed, as well as its subjective/objective roots. Scientific pluralism is discussed in relation with this study, as well as various philosophical teachnings about relativism, the Duhem-Quine thesis on the underdetermination of theory by facts, and the dialectics of knowledge and nature.
]]></description>
<dc:subject>philosophy-of-science physics controversy define-your-terms ontology pragmatism</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:f1238bbc3e51/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:physics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:controversy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:define-your-terms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:pragmatism"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1406.7331">
    <title>[1406.7331] Graphical Constructions for the sl(3), so(3) and G2 Invariants for Virtual Knots, Virtual Braids and Free Knots</title>
    <dc:date>2015-09-10T11:47:53+00:00</dc:date>
    <link>http://arxiv.org/abs/1406.7331</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We construct graph-valued analogues of the Kuperberg sl(3) and G2 invariants for virtual knots. The restriction of the sl(3) or G2 invariants for classical knots coincides with the usual Homflypt sl(3) invariant and G2 invariants. For virtual knots and graphs these invariants provide new graphical information that allows one to prove minimality theorems and to construct new invariants for free knots (unoriented and unlabeled Gauss codes taken up to abstract Reidemeister moves). A novel feature of this approach is that some knots are of sufficient complexity that they evaluate themselves in the sense that the invariant is the knot itself seen as a combinatorial structure. The paper generalizes these structures to virtual braids and discusses the relationship with the original Penrose bracket for graph colorings.
]]></description>
<dc:subject>knot-theory graph-theory visualization ontology representation nudge-targets consider:search-moves</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:c1601fd795ab/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:knot-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:graph-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:visualization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:search-moves"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1403.2194">
    <title>[1403.2194] Querying Geometric Figures Using a Controlled Language, Ontological Graphs and Dependency Lattices</title>
    <dc:date>2015-09-10T11:43:41+00:00</dc:date>
    <link>http://arxiv.org/abs/1403.2194</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Dynamic geometry systems (DGS) have become basic tools in many areas of geometry as, for example, in education. Geometry Automated Theorem Provers (GATP) are an active area of research and are considered as being basic tools in future enhanced educational software as well as in a next generation of mechanized mathematics assistants. Recently emerged Web repositories of geometric knowledge, like TGTP and Intergeo, are an attempt to make the already vast data set of geometric knowledge widely available. Considering the large amount of geometric information already available, we face the need of a query mechanism for descriptions of geometric constructions. 
In this paper we discuss two approaches for describing geometric figures (declarative and procedural), and present algorithms for querying geometric figures in declaratively and procedurally described corpora, by using a DGS or a dedicated controlled natural language for queries.
]]></description>
<dc:subject>computational-geometry plane-geometry ontology rather-interesting database data-structures search-engines nudge-targets consider:rediscovery consider:representation feature-construction</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:bc348892a63f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computational-geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:plane-geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:database"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:data-structures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:search-engines"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:rediscovery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:feature-construction"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1505.04112">
    <title>[1505.04112] How, What and Why to test an ontology</title>
    <dc:date>2015-06-20T12:18:21+00:00</dc:date>
    <link>http://arxiv.org/abs/1505.04112</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Ontology development relates to software development in that they both involve the production of formal computational knowledge. It is possible, therefore, that some of the techniques used in software engineering could also be used for ontologies; for example, in software engineering testing is a well-established process, and part of many different methodologies. 
The application of testing to ontologies, therefore, seems attractive. The Karyotype Ontology is developed using the novel Tawny-OWL library. This provides a fully programmatic environment for ontology development, which includes a complete test harness. 
In this paper, we describe how we have used this harness to build an extensive series of tests as well as used a commodity continuous integration system to link testing deeply into our development process; this environment, is applicable to any OWL ontology whether written using Tawny-OWL or not. Moreover, we present a novel analysis of our tests, introducing a new classification of what our different tests are. For each class of test, we describe why we use these tests, also by comparison to software tests. We believe that this systematic comparison between ontology and software development will help us move to a more agile form of ontology development.
]]></description>
<dc:subject>ontology test-driven-development rather-interesting continuous-integration travis-ci bioinformatics logic-programming the-mangle-in-practice</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:1fb8f4918a90/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:test-driven-development"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:continuous-integration"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:travis-ci"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:bioinformatics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:logic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:the-mangle-in-practice"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1405.5598">
    <title>[1405.5598] Grammars with two-sided contexts</title>
    <dc:date>2015-04-10T14:38:37+00:00</dc:date>
    <link>http://arxiv.org/abs/1405.5598</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In a recent paper (M. Barash, A. Okhotin, "Defining contexts in context-free grammars", LATA 2012), the authors introduced an extension of the context-free grammars equipped with an operator for referring to the left context of the substring being defined. This paper proposes a more general model, in which context specifications may be two-sided, that is, both the left and the right contexts can be specified by the corresponding operators. The paper gives the definitions and establishes the basic theory of such grammars, leading to a normal form and a parsing algorithm working in time O(n^4), where n is the length of the input string.
]]></description>
<dc:subject>grammar formal-languages representation computer-science ontology rather-interesting</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:0df297ccee72/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:grammar"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:formal-languages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1503.00279">
    <title>[1503.00279] Partial Derivative Automaton for Regular Expressions with Shuffle</title>
    <dc:date>2015-04-10T14:15:49+00:00</dc:date>
    <link>http://arxiv.org/abs/1503.00279</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We generalize the partial derivative automaton to regular expressions with shuffle and study its size in the worst and in the average case. The number of states of the partial derivative automata is in the worst case at most 2^m, where m is the number of letters in the expression, while asymptotically and on average it is no more than (4/3)^m.
]]></description>
<dc:subject>regular-expressions automata formal-languages representation rather-interesting to-understand nudge-targets ontology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:6bcfb28c74a8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:regular-expressions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:automata"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:formal-languages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1412.4847">
    <title>[1412.4847] A representation of robotic behaviors using component port arbitration</title>
    <dc:date>2015-03-15T12:45:18+00:00</dc:date>
    <link>http://arxiv.org/abs/1412.4847</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Developing applications considering reactiveness, scalability and re-usability has always been at the center of attention of robotic researchers. Behavior-based architectures have been proposed as a programming paradigm to develop robust and complex behaviors as integration of simpler modules whose activities are directly modulated by sensory feedback or input from other models. The design of behavior based systems, however, becomes increasingly difficult as the complexity of the application grows. This article proposes an approach for modeling and coordinating behaviors in distributed architectures based on port arbitration which clearly separates representation of the behaviors from the composition of the software components. Therefore, based on different behavioral descriptions, the same software components can be reused to implement different applications.
]]></description>
<dc:subject>robotics behavior-driven-design representation rather-interesting agent-based ontology nudge-targets problem-decomposition</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:42d8fd3dad7a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:robotics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:behavior-driven-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:agent-based"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:problem-decomposition"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1412.6082">
    <title>[1412.6082] Visual Concept Ontology for Image Annotations</title>
    <dc:date>2015-01-13T11:19:30+00:00</dc:date>
    <link>http://arxiv.org/abs/1412.6082</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In spite of the development of content-based data management, text-based searching remains the primary means of multimedia retrieval in many areas. Automatic creation of text metadata is thus a crucial tool for increasing the findability of multimedia objects. Search-based annotation tools try to provide content-descriptive keywords by exploiting web data, which are easily available but unstructured and noisy. Such data need to be analyzed with the help of semantic resources that provide knowledge about objects and relationships in a given domain. In this paper, we focus on the task of general-purpose image annotation and present the VCO, a new ontology of visual concepts developed as a part of image annotation framework. The ontology is linked with the WordNet lexical database, so the annotation tools can easily integrate information from both these resources.
]]></description>
<dc:subject>deep-learning ontology philosophy-of-engineering data-fusion rather-interesting nudge-targets consider:canned-structure image-processing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:2ea3fec57a82/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:data-fusion"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:canned-structure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:image-processing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1408.1110">
    <title>[1408.1110] Modeling Basic Aspects of Cyber-Physical Systems, Part II</title>
    <dc:date>2014-11-27T11:46:40+00:00</dc:date>
    <link>http://arxiv.org/abs/1408.1110</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We continue to consider the question of what language features are needed to effectively model cyber-physical systems (CPS). In previous work, we proposed using a core language as a way to study this question, and showed how several basic aspects of CPS can be modeled clearly in a language with a small set of constructs. This paper reports on the result of our analysis of two, more complex, case studies from the domain of rigid body dynamics. The first one, a quadcopter, illustrates that previously proposed core language can support larger, more interesting systems than previously shown. The second one, a serial robot, provides a concrete example of why we should add language support for static partial derivatives, namely that it would significantly improve the way models of rigid body dynamics can be expressed.
]]></description>
<dc:subject>modeling engineering-design languages the-mangle-in-practice ontology systems-thinking description philosophy-of-engineering philosophy-of-science describing-a-windmill-which-s-also-a-giant</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:fb0f4fb3ce85/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:modeling"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:languages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:the-mangle-in-practice"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:systems-thinking"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:description"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:describing-a-windmill-which-s-also-a-giant"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1409.1307">
    <title>[1409.1307] Using Modern Technologies to Capture and Share Indigenous Astronomical Knowledge</title>
    <dc:date>2014-11-07T11:39:08+00:00</dc:date>
    <link>http://arxiv.org/abs/1409.1307</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Indigenous Knowledge is important for Indigenous communities across the globe and for the advancement of our general scientific knowledge. In particular, Indigenous astronomical knowledge integrates many aspects of Indigenous Knowledge, including seasonal calendars, navigation, food economics, law, ceremony, and social structure. We aim to develop innovative ways of capturing, managing, and disseminating Indigenous astronomical knowledge for Indigenous communities and the general public for the future. Capturing, managing, and disseminating this knowledge in the digital environment poses a number of challenges, which we aim to address using a collaborative project involving experts in the higher education, library, and industry sectors. Using Microsoft's WorldWide Telescope and Rich Interactive Narratives technologies, we propose to develop software, media design, and archival management solutions to allow Indigenous communities to share their astronomical knowledge with the world on their terms and in a culturally sensitive manner.
]]></description>
<dc:subject>diversity anthropology archiving ontology rather-interesting</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:7ca87698feb5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:diversity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:anthropology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:archiving"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1410.4258">
    <title>[1410.4258] A Comprehensive Survey of Recent Advancements in Molecular Communication</title>
    <dc:date>2014-10-19T12:24:54+00:00</dc:date>
    <link>http://arxiv.org/abs/1410.4258</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In molecular communication, information is conveyed through chemical messages. With much advancement in the field of nanotechnology, bioengineering and synthetic biology over the past decade, micro- and nano-scales devices are becoming a reality. Yet the problem of engineering a reliable communication system between tiny devices is still an open problem. At the same time, despite the prevalence of radio communication, there are still areas where traditional electromagnetic waves find it difficult or expensive to reach. Points of interest in industry, cities, medical, and military applications often lie in embedded and entrenched areas, accessible only by ventricles at scales too small for conventional radio- and micro-waves, or they are located in such a way that directional high frequency systems are ineffective. Molecular communication is a biologically inspired communication scheme that could be employed for solving these problems. Although biologists have studied molecular communication, it is poorly understood from a telecommunication perspective. In this paper, we highlight the recent advancements in the field of molecular communication engineering.
]]></description>
<dc:subject>molecular-machinery biological-engineering communication systems-biology engineering-design design-patterns ontology review interesting</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:4b8177d27e7c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:molecular-machinery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biological-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:communication"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:systems-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:design-patterns"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:review"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:interesting"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1312.5914">
    <title>[1312.5914] Deep Separability of Ontological Constraints</title>
    <dc:date>2014-05-22T10:09:27+00:00</dc:date>
    <link>http://arxiv.org/abs/1312.5914</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[When data schemata are enriched with expressive constraints that aim at representing the domain of interest, in order to answer queries one needs to consider the logical theory consisting of both the data and the constraints. Query answering in such a context is called ontological query answering. Commonly adopted database constraints in this field are tuple-generating dependencies (TGDs) and equality-generating dependencies (EGDs). It is well known that their interaction leads to intractability or undecidability of query answering even in the case of simple subclasses. Several conditions have been found to guarantee separability, that is lack of interaction, between TGDs and EGDs. Separability makes EGDs (mostly) irrelevant for query answering and therefore often guarantees tractability, as long as the theory is satisfiable. In this paper we review the two notions of separability found in the literature, as well as several syntactic conditions that are sufficient to prove them. We then shed light on the issue of satisfiability checking, showing that under a sufficient condition called deep separability it can be done by considering the TGDs only. 
We show that, fortunately, in the case of TGDs and EGDs, separability implies deep separability. This result generalizes several analogous ones, proved ad hoc for particular classes of constraints. Applications include the class of sticky TGDs and EGDs, for which we provide a syntactic separability condition which extends the analogous one for linear TGDs; preliminary experiments show the feasibility of query answering in this case.
]]></description>
<dc:subject>databases ontology proof query-construction nudge-targets can't-wait-to-understand-it</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:38e3ce859302/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:databases"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:proof"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:query-construction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:can't-wait-to-understand-it"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://dreamsongs.com/Files/Incommensurability.pdf#page=1&amp;zoom=auto,0,792">
    <title>The Structure of a Programming Language Revolution</title>
    <dc:date>2014-04-28T13:13:07+00:00</dc:date>
    <link>http://dreamsongs.com/Files/Incommensurability.pdf#page=1&amp;zoom=auto,0,792</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Richard P. Gabriel
]]></description>
<dc:subject>programming via:jar ontology formalism language fundamentalism paradigms inter philosophy-of-engineering</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:ca167a4333db/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:via:jar"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:formalism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:fundamentalism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:paradigms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:inter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-engineering"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1401.3864">
    <title>[1401.3864] A Logical Study of Partial Entailment</title>
    <dc:date>2014-04-25T11:29:46+00:00</dc:date>
    <link>http://arxiv.org/abs/1401.3864</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We introduce a novel logical notion--partial entailment--to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with respect to a background formula set \Gamma intuitively means that under the circumstance of \Gamma, if P is true then some "part" of Q will also be true. We distinguish three different kinds of partial entailments and formalize them by using an extended notion of prime implicant. We study their semantic properties, which show that, surprisingly, partial entailments fail for many simple inference rules. Then, we study the related computational properties, which indicate that partial entailments are relatively difficult to be computed. Finally, we consider a potential application of partial entailments in reasoning about rational agents.
]]></description>
<dc:subject>logic computer-science out-of-the-box rather-interesting representation ontology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:25186232be93/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:logic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:out-of-the-box"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1309.5009">
    <title>[1309.5009] Parameterized Enumeration with Ordering</title>
    <dc:date>2014-04-04T11:22:17+00:00</dc:date>
    <link>http://arxiv.org/abs/1309.5009</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The classes Delay-FPT and Total-FPT recently have been introduced into parameterized complexity in order to capture the notion of efficiently solvable parameterized enumeration problems. In this paper we focus on ordered enumeration and will show how to obtain Delay-FPT and Total-FPT enumeration algorithms for several important problems. We propose a generic algorithmic strategy, combining well-known principles stemming from both parameterized algorithmics and enumeration, which shows that, under certain preconditions, the existence of a so-called neighbourhood function among the solutions implies the existence of a Delay-FPT algorithm which outputs all ordered solutions. In many cases, the cornerstone to obtain such a neighbourhood function is a Total-FPT algorithm that outputs all minimal solutions. This strategy is formalized in the context of graph modification problems, and shown to be applicable to numerous other kinds of problems.
]]></description>
<dc:subject>computational-complexity algorithms stamp-collecting ontology the-invention-of-ontologies</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3804c7465e63/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computational-complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:stamp-collecting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:the-invention-of-ontologies"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1401.3885">
    <title>[1401.3885] Scaling up Heuristic Planning with Relational Decision Trees</title>
    <dc:date>2014-02-26T11:18:22+00:00</dc:date>
    <link>http://arxiv.org/abs/1401.3885</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are worth the expense. However, when evaluation functions are misguiding or when planning problems are large enough, lots of node evaluations must be computed, which severely limits the scalability of heuristic planners. In this paper, we present a novel solution for reducing node evaluations in heuristic planning based on machine learning. Particularly, we define the task of learning search control for heuristic planning as a relational classification task, and we use an off-the-shelf relational classification tool to address this learning task. Our relational classification task captures the preferred action to select in the different planning contexts of a specific planning domain. These planning contexts are defined by the set of helpful actions of the current state, the goals remaining to be achieved, and the static predicates of the planning task. This paper shows two methods for guiding the search of a heuristic planner with the learned classifiers. The first one consists of using the resulting classifier as an action policy. The second one consists of applying the classifier to generate lookahead states within a Best First Search algorithm. Experiments over a variety of domains reveal that our heuristic planner using the learned classifiers solves larger problems than state-of-the-art planners.
]]></description>
<dc:subject>planning machine-learning nudge-targets ontology algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:1ce8aefbcc76/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:planning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1308.4206">
    <title>[1308.4206] Nested Nonnegative Cone Analysis</title>
    <dc:date>2013-09-15T13:26:20+00:00</dc:date>
    <link>http://arxiv.org/abs/1308.4206</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Motivated by the analysis of nonnegative data objects, a novel Nested Nonnegative Cone Analysis (NNCA) approach is proposed to overcome some drawbacks of existing methods. The application of traditional PCA/SVD method to nonnegative data often cause the approximation matrix leave the nonnegative cone, which leads to non-interpretable and sometimes nonsensical results. The nonnegative matrix factorization (NMF) approach overcomes this issue, however the NMF approximation matrices suffer several drawbacks: 1) the factorization may not be unique, 2) the resulting approximation matrix at a specific rank may not be unique, and 3) the subspaces spanned by the approximation matrices at different ranks may not be nested. These drawbacks will cause troubles in determining the number of components and in multi-scale (in ranks) interpretability. The NNCA approach proposed in this paper naturally generates a nested structure, and is shown to be unique at each rank. Simulations are used in this paper to illustrate the drawbacks of the traditional methods, and the usefulness of the NNCA method.
]]></description>
<dc:subject>statistics metric-spaces algorithms representation nudge-targets ontology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:1c57c9605cf1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metric-spaces"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1212.4522">
    <title>[1212.4522] A Multi-View Embedding Space for Modeling Internet Images, Tags, and their Semantics</title>
    <dc:date>2013-09-14T19:39:09+00:00</dc:date>
    <link>http://arxiv.org/abs/1212.4522</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[This paper investigates the problem of modeling Internet images and associated text or tags for tasks such as image-to-image search, tag-to-image search, and image-to-tag search (image annotation). We start with canonical correlation analysis (CCA), a popular and successful approach for mapping visual and textual features to the same latent space, and incorporate a third view capturing high-level image semantics, represented either by a single category or multiple non-mutually-exclusive concepts. We present two ways to train the three-view embedding: supervised, with the third view coming from ground-truth labels or search keywords; and unsupervised, with semantic themes automatically obtained by clustering the tags. To ensure high accuracy for retrieval tasks while keeping the learning process scalable, we combine multiple strong visual features and use explicit nonlinear kernel mappings to efficiently approximate kernel CCA. To perform retrieval, we use a specially designed similarity function in the embedded space, which substantially outperforms the Euclidean distance. The resulting system produces compelling qualitative results and outperforms a number of two-view baselines on retrieval tasks on three large-scale Internet image datasets.
]]></description>
<dc:subject>classification algorithms tagging clustering natural-language-processing ontology nudge-targets</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:7eb89681ca7d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:tagging"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:clustering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:natural-language-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1309.2981">
    <title>[1309.2981] A Non-Phylogenetic Conceptual Network Architecture for Organizing Classes of Material Artifacts into Cultural Lineages</title>
    <dc:date>2013-09-14T16:48:24+00:00</dc:date>
    <link>http://arxiv.org/abs/1309.2981</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The application of phylogenetic techniques to the documentation of cultural history can present a distorted picture due to horizontal transmission and blending. Moreover, the units of cultural transmission must be communicable concepts, rather than conveniently measurable attributes, and relatedness between elements of culture often resides at the conceptual level, something not captured by phylogenetic methods, which focus on measurable attributes. (For example, mortars and pestles are as related as two artifacts could be, despite little similarity at the attribute level.) This paper introduces a new, cognitively inspired framework for chronicling material cultural history, building on Lipo's (2005) network-based computational approach. We show that by incorporating not just superficial attributes of artifact samples (e.g. fluting) but also conceptual knowledge (e.g. information about function), a different pattern of cultural ancestry emerges.
]]></description>
<dc:subject>phylogenetics classification material-culture ontology algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e48fd1938814/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:phylogenetics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:material-culture"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1110.4499">
    <title>[1110.4499] Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full)</title>
    <dc:date>2013-07-24T10:52:22+00:00</dc:date>
    <link>http://arxiv.org/abs/1110.4499</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[A classic experiment by Milgram shows that individuals can route messages along short paths in social networks, given only simple categorical information about recipients (such as "he is a prominent lawyer in Boston" or "she is a Freshman sociology major at Harvard"). That is, these networks have very short paths between pairs of nodes (the so-called small-world phenomenon); moreover, participants are able to route messages along these paths even though each person is only aware of a small part of the network topology. Some sociologists conjecture that participants in such scenarios use a greedy routing strategy in which they forward messages to acquaintances that have more categories in common with the recipient than they do, and similar strategies have recently been proposed for routing messages in dynamic ad-hoc networks of mobile devices. In this paper, we introduce a network property called membership dimension, which characterizes the cognitive load required to maintain relationships between participants and categories in a social network. We show that any connected network has a system of categories that will support greedy routing, but that these categories can be made to have small membership dimension if and only if the underlying network exhibits the small-world phenomenon.
]]></description>
<dc:subject>ontology social-networks multimodal-networks network-theory interesting</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:86c10fe29d98/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:social-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:multimodal-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:network-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:interesting"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1306.5577">
    <title>[1306.5577] A Note on Elementary Cellular Automata Classification</title>
    <dc:date>2013-07-21T14:53:28+00:00</dc:date>
    <link>http://arxiv.org/abs/1306.5577</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We overview and compare classifications of elementary cellular automata, including Wolfram's, Wuensche's, Li and Packard, communication complexity, power spectral, topological, surface, compression, lattices, and morphological diversity classifications. This paper summarises several classifications of elementary cellular automata (ECA) and compares them with a newly proposed one, that induced by endowing rules with memory.
]]></description>
<dc:subject>stamp-collecting cellular-automata classification ontology Wolframism edge-of-chaos artificial-life interesting</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:c6e6bc0aedb2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:stamp-collecting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cellular-automata"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Wolframism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:edge-of-chaos"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:artificial-life"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:interesting"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1201.4089">
    <title>[1201.4089] A Description Logic Primer</title>
    <dc:date>2013-06-17T12:45:35+00:00</dc:date>
    <link>http://arxiv.org/abs/1201.4089</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[This paper provides a self-contained first introduction to description logics (DLs). The main concepts and features are explained with examples before syntax and semantics of the DL SROIQ are defined in detail. Additional sections review light-weight DL languages, discuss the relationship to the Web Ontology Language OWL and give pointers to further reading.
]]></description>
<dc:subject>logic logic-programming ontology tutorial language</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:b53114518210/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:logic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:logic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:tutorial"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:language"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ontology.buffalo.edu/smith/articles/fiat.htm">
    <title>Barry Smith: Fiat Objects</title>
    <dc:date>2013-06-11T20:43:00+00:00</dc:date>
    <link>http://ontology.buffalo.edu/smith/articles/fiat.htm</link>
    <dc:creator>Vaguery</dc:creator><dc:subject>ontology philosophy philosophy-of-science that-word-you-keep-using via:jar nice</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:706a5ced5b43/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:that-word-you-keep-using"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:via:jar"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nice"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1212.5389">
    <title>[1212.5389] Relationship-aware sequential pattern mining</title>
    <dc:date>2013-03-15T11:22:21+00:00</dc:date>
    <link>http://arxiv.org/abs/1212.5389</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Relationship-aware sequential pattern mining is the problem of mining frequent patterns in sequences in which the events of a sequence are mutually related by one or more concepts from some respective hierarchical taxonomies, based on the type of the events. Additionally events themselves are also described with a certain number of taxonomical concepts. We present RaSP an algorithm that is able to mine relationship-aware patterns over such sequences; RaSP follows a two stage approach. In the first stage it mines for frequent type patterns and {\em all} their occurrences within the different sequences. In the second stage it performs hierarchical mining where for each frequent type pattern and its occurrences it mines for more specific frequent patterns in the lower levels of the taxonomies. We test RaSP on a real world medical application, that provided the inspiration for its development, in which we mine for frequent patterns of medical behavior in the antibiotic treatment of microbes and show that it has a very good computational performance given the complexity of the relationship-aware sequential pattern mining problem.]]></description>
<dc:subject>ontology data-analysis data-mining pattern-discovery nudge-targets They're-all-there-Eddie-now-we've-got-to-get-them-in-the-right-order</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:610ed161cc3f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:data-analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:data-mining"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:pattern-discovery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:They're-all-there-Eddie-now-we've-got-to-get-them-in-the-right-order"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1211.1144">
    <title>[1211.1144] Genome-wide association studies with high-dimensional phenotypes</title>
    <dc:date>2013-03-09T00:49:16+00:00</dc:date>
    <link>http://arxiv.org/abs/1211.1144</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[High-dimensional phenotypes hold promise for richer findings in association studies, but testing of several phenotype traits aggravates the grand challenge of association studies, that of multiple testing. Several methods have recently been proposed for testing jointly all traits in a high-dimensional vector of phenotypes, with prospect of increased power to detect small effects that would be missed if tested individually. However, the methods have rarely been compared to the extent of enabling assessment of their relative merits and setting up guidelines on which method to use, and how to use it. We compare the methods on simulated data and with a real metabolomics data set comprising 137 highly correlated variables and approximately 550,000 SNPs. Applying the methods to genome-wide data with hundreds of thousands of markers inevitably requires division of the problem into manageable parts facilitating parallel processing, parts corresponding to individual genetic variants, pathways, or genes, for example. Here we utilize a straightforward formulation according to which the genome is divided into blocks of nearby correlated genetic markers, tested jointly for association with the phenotypes. This formulation is computationally feasible, reduces the number of tests, and lets the methods take advantage of combining information over several correlated variables not only on the phenotype side, but also on the genotype side. Our experiments show that canonical correlation analysis has higher power than alternative methods, while remaining computationally tractable for routine use in the GWAS setting, provided the number of samples is sufficient compared to the numbers of phenotype and genotype variables tested. Regression models with latent confounding factors show promising performance when the number of samples is small compared to the dimensionality of the data.]]></description>
<dc:subject>finally representation genetics GWAS bioinformatics it's-more-complicated-than-you-think nudge-targets measurement ontology methods-of-discovery</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:f538f40b6bf3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:finally"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:genetics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:GWAS"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:bioinformatics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:it's-more-complicated-than-you-think"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:measurement"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:methods-of-discovery"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1301.3876">
    <title>[1301.3876] Probabilistic Models for Agents' Beliefs and Decisions</title>
    <dc:date>2013-03-03T21:37:18+00:00</dc:date>
    <link>http://arxiv.org/abs/1301.3876</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Many applications of intelligent systems require reasoning about the mental states of agents in the domain. We may want to reason about an agent's beliefs, including beliefs about other agents; we may also want to reason about an agent's preferences, and how his beliefs and preferences relate to his behavior. We define a probabilistic epistemic logic (PEL) in which belief statements are given a formal semantics, and provide an algorithm for asserting and querying PEL formulas in Bayesian networks. We then show how to reason about an agent's behavior by modeling his decision process as an influence diagram and assuming that he behaves rationally. PEL can then be used for reasoning from an agent's observed actions to conclusions about other aspects of the domain, including unobserved domain variables and the agent's mental states.]]></description>
<dc:subject>inference ontology artificial-intelligence nudge-targets</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:7c9093844c5b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:inference"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:artificial-intelligence"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1302.1554">
    <title>[1302.1554] Object-Oriented Bayesian Networks</title>
    <dc:date>2013-03-03T21:15:52+00:00</dc:date>
    <link>http://arxiv.org/abs/1302.1554</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. They have been successfully applied in a variety of medium-scale applications. However, when faced with a large complex domain, the task of modeling using Bayesian networks begins to resemble the task of programming using logical circuits. In this paper, we describe an object-oriented Bayesian network (OOBN) language, which allows complex domains to be described in terms of inter-related objects. We use a Bayesian network fragment to describe the probabilistic relations between the attributes of an object. These attributes can themselves be objects, providing a natural framework for encoding part-of hierarchies. Classes are used to provide a reusable probabilistic model which can be applied to multiple similar objects. Classes also support inheritance of model fragments from a class to a subclass, allowing the common aspects of related classes to be defined only once. Our language has clear declarative semantics: an OOBN can be interpreted as a stochastic functional program, so that it uniquely specifies a probabilistic model. We provide an inference algorithm for OOBNs, and show that much of the structural information encoded by an OOBN--particularly the encapsulation of variables within an object and the reuse of model fragments in different contexts--can also be used to speed up the inference process.]]></description>
<dc:subject>models statistics machine-learning ontology algorithms architecture nudge-targets</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:1c848f2de2f3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:architecture"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1211.3497">
    <title>[1211.3497] Ontology Based Information Extraction for Disease Intelligence</title>
    <dc:date>2013-03-03T13:08:38+00:00</dc:date>
    <link>http://arxiv.org/abs/1211.3497</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Disease Intelligence (DI) is based on the acquisition and aggregation of fragmented knowledge of diseases at multiple sources all over the world to provide valuable information to doctors, researchers and information seeking community. Some diseases have their own characteristics changed rapidly at different places of the world and are reported on documents as unrelated and heterogeneous information which may be going unnoticed and may not be quickly available. This research presents an Ontology based theoretical framework in the context of medical intelligence and country/region. Ontology is designed for storing information about rapidly spreading and changing diseases with incorporating existing disease taxonomies to genetic information of both humans and infectious organisms. It further maps disease symptoms to diseases and drug effects to disease symptoms. The machine understandable disease ontology represented as a website thus allows the drug effects to be evaluated on disease symptoms and exposes genetic involvements in the human diseases. Infectious agents which have no known place in an existing classification but have data on genetics would still be identified as organisms through the intelligence of this system. It will further facilitate researchers on the subject to try out different solutions for curing diseases.]]></description>
<dc:subject>natural-language-processing data-mining text-mining ontology formalization domain-knowledge nudge-targets epidemiology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e6a58b286e16/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:natural-language-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:data-mining"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:text-mining"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:formalization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:domain-knowledge"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:epidemiology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1207.4708">
    <title>[1207.4708] The Arcade Learning Environment: An Evaluation Platform for General Agents</title>
    <dc:date>2012-08-12T12:59:11+00:00</dc:date>
    <link>http://arxiv.org/abs/1207.4708</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["In this article we introduce the Arcade Learning Environment (ALE): both a challenge problem and a platform and methodology for evaluating the development of general, domain-independent AI technology. ALE provides an interface to hundreds of Atari 2600 game environments, each one different, interesting, and designed to be a challenge for human players. ALE presents significant research challenges for reinforcement learning, model learning, model-based planning, imitation learning, transfer learning, and intrinsic motivation. Most importantly, it provides a rigorous testbed for evaluating and comparing approaches to these problems. We illustrate the promise of ALE by developing and benchmarking domain-independent agents designed using well-established AI techniques for both reinforcement learning and planning. In doing so, we also propose a methodology for evaluation made possible by ALE, reporting empirical results on over 55 different games. All of the software, including the benchmark agents, is publicly available."]]></description>
<dc:subject>artificial-intelligence machine-learning evaluation ontology representation experiment nudge-targets</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:55725a7b38b4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:artificial-intelligence"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:evaluation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:experiment"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://tapestryjava.blogspot.se/2012/07/you-cannot-correctly-represent-change.html">
    <title>Tapestry Central: You Cannot Correctly Represent Change Without Immutability</title>
    <dc:date>2012-07-05T12:18:27+00:00</dc:date>
    <link>http://tapestryjava.blogspot.se/2012/07/you-cannot-correctly-represent-change.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["With immutability, changes in state are really new objects; a new version, or "quantifiable set of qualities", that does not affect the original version. It is possible to compare two different iterations of the same object to see the "deltas". In Datomic, you even have more meta-data about when such state changes occur, what else changed within the same transaction, and who is the responsible party for that transaction."]]></description>
<dc:subject>programming ontology philosophy-of-engineering immutability</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:356099f3cad6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:immutability"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1206.3421">
    <title>[1206.3421] Linear Latent Variable Models: The lava-package</title>
    <dc:date>2012-07-02T22:45:47+00:00</dc:date>
    <link>http://arxiv.org/abs/1206.3421</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["An R package for specifying and estimating linear latent variable models is presented. The philosophy of the implementation is to separate the model specification from the actual data, which leads to a dynamic and easy way of modeling complex hierarchical structures. Several advanced features are implemented including robust standard errors for clustered correlated data, multigroup analyses, non-linear parameter constraints, inference with incomplete data, maximum likelihood estimation with censored and binary observations, and instrumental variable estimators. In addition an extensive simulation interface covering a broad range of non-linear generalized structural equation models is described. The model and software are demonstrated in data of measurements of the serotonin transporter in the human brain."]]></description>
<dc:subject>ontology statistics algorithms R-language linear-models model-view-controller design-patterns</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:29ac44a78a23/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:R-language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:linear-models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:model-view-controller"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:design-patterns"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1206.3520">
    <title>[1206.3520] Recovering the tree-like trend of evolution despite extensive lateral genetic transfer: A probabilistic analysis</title>
    <dc:date>2012-06-29T11:58:45+00:00</dc:date>
    <link>http://arxiv.org/abs/1206.3520</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["In the presence of highways, dealing with more general network settings would be desirable. Also our definition of highways as connecting two edges is somewhat restrictive. In general, one is also interested in preferential genetic transfers between clades."]]></description>
<dc:subject>algorithms lateral-gene-transfer cladistics phylogenetics inverse-problems ontology modeling-is-not-mathematics nudge-targets</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:cd757430982c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:lateral-gene-transfer"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cladistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:phylogenetics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:inverse-problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:modeling-is-not-mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1206.3279">
    <title>[1206.3279] The Phylogenetic Indian Buffet Process: A Non-Exchangeable Nonparametric Prior for Latent Features</title>
    <dc:date>2012-06-29T11:55:49+00:00</dc:date>
    <link>http://arxiv.org/abs/1206.3279</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["Nonparametric Bayesian models are often based on the assumption that the objects being modeled are exchangeable. While appropriate in some applications (e.g., bag-of-words models for documents), exchangeability is sometimes assumed simply for computational reasons; non-exchangeable models might be a better choice for applications based on subject matter. Drawing on ideas from graphical models and phylogenetics, we describe a non-exchangeable prior for a class of nonparametric latent feature models that is nearly as efficient computationally as its exchangeable counterpart. Our model is applicable to the general setting in which the dependencies between objects can be expressed using a tree, where edge lengths indicate the strength of relationships. We demonstrate an application to modeling probabilistic choice."]]></description>
<dc:subject>statistics algorithms ontology colligation feature-extraction philosophy-of-science nudge-targets</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:b27d6456c1cc/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:colligation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:feature-extraction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1204.6391">
    <title>[1204.6391] Extending partial representations of function graphs and permutation graphs</title>
    <dc:date>2012-06-22T11:13:19+00:00</dc:date>
    <link>http://arxiv.org/abs/1204.6391</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0,1] and are known to be exactly the complements of comparability graphs. As such they are recognizable in polynomial time. Function graphs generalize permutation graphs, which arise when all functions considered are linear. 
We focus on the problem of extending partial representations, which generalizes the recognition problem. We observe that for permutation graphs an easy extension of Golumbic's comparability graph recognition algorithm can be exploited. This approach fails for function graphs. Nevertheless, we present a polynomial-time algorithm for extending a partial representation of a graph by functions defined on the entire interval [0,1] provided for some of the vertices. On the other hand, we show that if a partial representation consists of functions defined on subintervals of [0,1], then the problem of extending this representation to functions on the entire interval [0,1] becomes NP-complete."]]></description>
<dc:subject>graph-theory math-i-didn't-know representation-theory ontology interesting</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:9aa635cbf159/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:graph-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:math-i-didn't-know"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:interesting"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ecologywithoutnature.blogspot.com/p/ooo-for-beginners.html">
    <title>Ecology without Nature: OOO (Start Here)</title>
    <dc:date>2011-10-01T12:54:04+00:00</dc:date>
    <link>http://ecologywithoutnature.blogspot.com/p/ooo-for-beginners.html</link>
    <dc:creator>Vaguery</dc:creator><dc:subject>philosophy ontology pragmatism-it-ain't which-is-weird</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:61d079e964e2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:pragmatism-it-ain't"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:which-is-weird"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1105.6001">
    <title>[1105.6001] A Call to Arms: Revisiting Database Design</title>
    <dc:date>2011-08-03T15:02:51+00:00</dc:date>
    <link>http://arxiv.org/abs/1105.6001</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["Good database design is crucial to obtain a sound, consistent database, and - in turn - good database design methodologies are the best way to achieve the right design. These methodologies are taught to most Computer Science undergraduates, as part of any Introduction to Database class. They can be considered part of the "canon", and indeed, the overall approach to database design has been unchanged for years. Moreover, none of the major database research assessments identify database design as a strategic research direction. 

Should we conclude that database design is a solved problem? 

Our thesis is that database design remains a critical unsolved problem. Hence, it should be the subject of more research. Our starting point is the observation that traditional database design is not used in practice - and if it were used it would result in designs that are not well adapted to current environments. In short, database design has failed to keep up with the times. In this paper, we put forth arguments to support our viewpoint, analyze the root causes of this situation and suggest some avenues of research."]]></description>
<dc:subject>database ontology software-development computer-science design-patterns</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:be5b4e1d4f40/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:database"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:software-development"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:design-patterns"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1006.5731">
    <title>[1006.5731] A Taxonomy of Networks</title>
    <dc:date>2010-07-29T14:37:24+00:00</dc:date>
    <link>http://arxiv.org/abs/1006.5731</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["The study of networks has grown into a substantial interdisciplinary endeavor across the natural, social, and information sciences. Yet there have been very few attempts to investigate the interrelatedness of the different classes of networks studied by different disciplines. Here, we introduced a framework to establish a taxonomy of networks from various origins. The provision of this family tree not only helps understand the kinship of networks, but also facilitates the transfer of empirical analysis, theoretical modeling, and conceptual developments across disciplinary boundaries. The framework is based on probing the mesoscopic properties of networks, an important source of heterogeneity for their structure and function. Using our method, we computed a taxonomy for 752 individual networks and a separate taxonomy for 12 network classes. We also computed three within-class taxonomies for political, fungal, and financial networks, and found them to be insightful in each case."
]]></description>
<dc:subject>nudge-targets classification models network-theory statistics complexology ontology taxonomy</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:8d420d2df366/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:network-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:complexology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:taxonomy"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1007.3794">
    <title>[1007.3794] Open Graphs and Computational Reasoning</title>
    <dc:date>2010-07-28T12:35:13+00:00</dc:date>
    <link>http://arxiv.org/abs/1007.3794</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of half-edges (edges which are drawn with an unconnected end) and enjoy rich compositional principles by connecting graphs along these half-edges. In particular, this allows equations and rewrite rules to be specified between graphs. Particular computational models can then be encoded as an axiomatic set of such rules. Further rules can be derived graphically and rewriting can be used to simulate the dynamics of a computational system, e.g. evaluating a program on an input. Examples of models which can be formalised in this way include traditional electronic circuits as well as recent categorical accounts of quantum information."
]]></description>
<dc:subject>nudge-targets dataflow model computer-science language formalization ontology</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:91d60588b21e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:dataflow"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:model"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:formalization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://edgeofthewest.wordpress.com/2010/03/04/lessons-of-history-2/">
    <title>Lessons of History « The Edge of the American West</title>
    <dc:date>2010-03-07T13:35:52+00:00</dc:date>
    <link>http://edgeofthewest.wordpress.com/2010/03/04/lessons-of-history-2/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["The effect of that “Yes, but…” is to make scholarly history complex and at the same time weaselly, uncertain and always whirling around to catch the interpretation sneaking up from behind.

The complexity that this creates is, of course, at odds both with the simplicity that Paul Krugman craved and that economics provided. It is at odds, as well, with the adversarial nature of the court room, in which opposing counsels must argue, without doubt or allowance for ambiguity, their side of the case. It is why Krugman was right to leave history behind, for that complex ambivalence is at the heart of the historical project. Staying with a subject whose central tenet he found repulsive would have been difficult, at best. It is why historians like Ambrose were wrong to testify for the tobacco companies, because their testimony came in service of an argument in which the essential equivocation was stripped away."
]]></description>
<dc:subject>ontology pragmatism history history-is-a-feature-not-a-bug idealism-and-realism-sittin-in-a-tree</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3f213efc9fbf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:pragmatism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:history"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:history-is-a-feature-not-a-bug"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:idealism-and-realism-sittin-in-a-tree"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.loc.gov/cds/FRBR.html">
    <title>What is FRBR?</title>
    <dc:date>2009-04-21T11:15:42+00:00</dc:date>
    <link>http://www.loc.gov/cds/FRBR.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["Based on an article originally published in Technicalities (v. 25, no. 5, Sept./Oct. 2003), this pamphlet provides a brief overview of the Functional Requirements for Bibliographic Records (FRBR) as developed by the International Federation of Library Associations (IFLA). Using full-color graphics, What is FRBR? outlines the background of the development of the Functional Requirements, the concepts involved and their potential impact on cataloging rules, bibliographic structures and systems design for cataloging applications."
]]></description>
<dc:subject>books cataloging bibliography metadata libraries technical specification ontology bookphile bibliographies</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e41cb0e8fdc9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:books"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cataloging"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:bibliography"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metadata"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:libraries"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:technical"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:specification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ontology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:bookphile"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:bibliographies"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>