The semantic paradoxes are often associated with self-reference or referential circularity. Yablo (Analysis 53(4):251–252, 1993), however, has shown that there are infinitary versions of the paradoxes that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality. In this essay, we lay the groundwork for a general investigation into the nature of reference structures that support the semantic paradoxes and the semantic (...) hypodoxes. We develop a functionally complete infinitary propositional language endowed with a denotation assignment and extract the reference structural information in terms of graph-theoretic properties. We introduce the new concepts of dangerous and precarious reference graphs, which allows us to rigorously define the task: classify the dangerous and precarious directed graphs purely in terms of their graph-theoretic properties. Ungroundedness will be shown to fully characterize the precarious reference graphs and fully characterize the dangerous finite graphs. We prove that an undirected graph has a dangerous orientation if and only if it contains a cycle, providing some support for the traditional idea that cyclic structure is required for paradoxicality. This leaves the task of classifying danger for infinite acyclic reference graphs. We provide some compactness results, which give further necessary conditions on danger in infinite graphs, which in conjunction with a notion of self-containment allows us to prove that dangerous acyclic graphs must have infinitely many vertices with infinite out-degree. But a full characterization of danger remains an open question. In the appendices we relate our results to the results given in Cook (J Symb Log 69(3):767–774, 2004) and Yablo (2006) with respect to more restricted sentences systems, which we call $\mathcal{F}$ -systems. (shrink)

We introduce a framework for a graph-theoretic analysis of the semantic paradoxes. Similar frameworks have been recently developed for infinitary propositional languages by Cook and Rabern, Rabern, and Macauley. Our focus, however, will be on the language of first-order arithmetic augmented with a primitive truth predicate. Using Leitgeb’s notion of semantic dependence, we assign reference graphs (rfgs) to the sentences of this language and define a notion of paradoxicality in terms of acceptable decorations of rfgs with truth values. (...) It is shown that this notion of paradoxicality coincides with that of Kripke. In order to track down the structural components of an rfg that are responsible for paradoxicality, we show that any decoration can be obtained in a three-stage process: first, the rfg is unfolded into a tree, second, the tree is decorated with truth values (yielding a dependence tree in the sense of Yablo), and third, the decorated tree is re-collapsed onto the rfg. We show that paradoxicality enters the picture only at stage three. Due to this we can isolate two basic patterns necessary for paradoxicality. Moreover, we conjecture a solution to the characterization problem for dangerous rfgs that amounts to the claim that basically the Liar- and the Yablo graph are the only paradoxical rfgs. Furthermore, we develop signed rfgs that allow us to distinguish between ‘positive’ and ‘negative’ reference and obtain more fine-grained versions of our results for unsigned rfgs. (shrink)

This paper presents a Conceptual Graph (CG) framework to the Generation of Referring Expressions (GRE). Employing Conceptual Graphs as the underlying formalism allows a rigorous, semantically rich, approach to GRE. A number of advantages over existing work are discussed. The new framework is also used to revisit existing complexity results in a fully rigorous way, showing that the expressive power of CGs does not increase the theoretical complexity of GRE.

Graph-based frames have been introduced as a logical framework which internalises an inherent boundary to knowability (referred to as ‘informational entropy’), due, e.g. to perceptual, evidential or linguistic limits. They also support the interpretation of lattice-based (modal) logics as hyper-constructive logics of evidential reasoning. Conceptually, the present paper proposes graph-based frames as a formal framework suitable for generalising Pawlak's rough set theory to a setting in which inherent limits to knowability exist and need to be considered. Technically, the present paper (...) establishes systematic connections between the first-order correspondents of Sahlqvist modal reduction principles on Kripke frames, and on the more general relational environments of graph-based and polarity-based frames. This work is part of a research line aiming at: (a) comparing and inter-relating the various (first-order) conditions corresponding to a given (modal) axiom in different relational semantics; (b) recognising when first-order sentences in the frame-correspondence languages of different relational structures encode the same ‘modal content’; (c) meaningfully transferring relational properties across different semantic contexts. The present paper develops these results for the graph-based semantics, polarity-based semantics, and all Sahlqvist modal reduction principles. As an application, we study well known modal axioms in rough set theory (such as those corresponding to seriality, reflexivity, and transitivity) on graph-based frames and show that, although these axioms correspond to different first-order conditions on graph-based frames, their intuitive meaning is retained. This allows us to introduce the notion of hyperconstructivist approximation spaces as the subclass of graph-based frames defined by the first-order conditions corresponding to the same modal axioms defining classical generalised approximation spaces, and to transfer the properties and the intuitive understanding of different approximation spaces to the more general framework of graph-based frames. The approach presented in this paper provides a base for systematically comparing and connecting various formal frameworks in rough set theory, and for the transfer of insights across different frameworks. (shrink)

In the field of natural language processing, the task of sensitive information detection refers to the procedure of identifying sensitive words for given documents. The majority of existing detection methods are based on the sensitive-word tree, which is usually constructed via the common prefixes of different sensitive words from the given corpus. Yet, these traditional methods suffer from a couple of drawbacks, such as poor generalization and low efficiency. For improvement purposes, this paper proposes a novel self-attention-based detection algorithm using (...) the implementation of graph convolutional network. The main contribution is twofold. Firstly, we consider a weighted GCN to better encode word pairs from the given documents and corpus. Secondly, a simple, yet effective, attention mechanism is introduced to further integrate the interaction among candidate words and corpus. Experimental results from the benchmarking dataset of THUC news demonstrate a promising detection performance, compared to existing work. (shrink)

This paper provides an analysis of the notational difference between Beta Existential Graphs, the graphical notation for quantificational logic invented by Charles S. Peirce at the end of the 19th century, and the ordinary notation of first-order logic. Peirce thought his graphs to be “more diagrammatic” than equivalently expressive languages for quantificational logic. The reason of this, he claimed, is that less room is afforded in Existential Graphs than in equivalently expressive languages for different ways of representing (...) the same fact. The reason of this, in turn, is that Existential Graphs are a non-linear, occurrence-referential notation. As a non-linear notation, each graph corresponds to a class of logically equivalent but syntactically distinct sentences of the ordinary notation of first-order logic that are obtained by permuting those elements that in the graphs lie in the same area. As an occurrence-referential notation, each Beta graph corresponds to a class of logically equivalent but syntactically distinct sentences of the ordinary notation of first-order logic in which the identity of reference of two or more variables is asserted. In brief, Peirce’s graphs are more diagrammatic than the linear, type-referential notation of first-order logic because the function that translates the latter to the graphs does not define isomorphism between the two notations. (shrink)

The logic of assertive graphs (AGs) is a modification of Peirce’s logic of existential graphs (EGs), which is intuitionistic and which takes assertions as its explicit object of study. In this paper we extend AGs into a classical graphical logic of assertions (ClAG) whose internal logic is classical. The characteristic feature is that both AGs and ClAG retain deep-inference rules of transformation. Unlike classical EGs, both AGs and ClAG can do so without explicitly introducing polarities of areas in (...) their language. We then compare advantages of these two graphical approaches to the logic of assertions with a reference to a number of topics in philosophy of logic and to their deep-inferential nature of proofs. (shrink)

Graph theory is one of those subjects that is a vital part of the digital world. It is used to monitor the movement of robots on a network, to debug computer networks, to develop algorithms, and to analyze the structural properties of chemical structures, among other things. It is also useful in airplane scheduling and the study of diffusion mechanisms. The parameters computed in this article are very useful in pattern recognition and image processing. A number d f, w = (...) min d w, t, d w, s is referred as distance between f = t s an edge and w a vertex. d w, f 1 ≠ d w, f 2 implies that two edges f 1, f 2 ∈ E are resolved by node w ∈ V. A set of nodes A is referred to as an edge metric generator if every two links/edges of Γ are resolved by some nodes of A and least cardinality of such sets is termed as edge metric dimension, e dim Γ for a graph Γ. A set B of some nodes of Γ is a mixed metric generator if any two members of V ∪ E are resolved by some members of B. Such a set B with least cardinality is termed as mixed metric dimension, m dim Γ. In this paper, the metric dimension, edge metric dimension, and mixed metric dimension of dragon graph T n, m, line graph of dragon graph L T n, m, paraline graph of dragon graph L S T n, m, and line graph of line graph of dragon graph L L T n, m have been computed. It is shown that these parameters are constant, and a comparative analysis is also given for the said families of graphs. (shrink)

From my ongoing "Metalogical Plato" project. The aim of the diagram is to make reasonably intuitive how the Socratic elenchos (the logic of refutation applied to candidate formulations of virtues or ruling knowledges) looks and works as a whole structure. This is my starting point in the project, in part because of its great familiarity and arguable claim to being the inauguration of western philosophy; getting this point less wrong would have broad and deep consequences, including for philosophy’s self-understanding. -/- (...) (i.) is the first pass at elenchos in which the Socratic interlocutor does not reflect on knowledge being the crux of the problem. (ii.) is the second, rarer, reflective pass in which they are, making the investigation explicitly about knowledge. Its centrality in the Charmides makes that neglected dialogue of superlative importance. This structure is also the gateway through which the discussion/dialectic crosses into the Agathology (discussion of the form of the good) at Republic 505. -/- The problem of elenchos, then, grasped as a whole structure, is that it seems that knowledge can neither satisfactorily be included in nor excluded from its own scope. The development of the ti esti (“what is ---?”) question leads to the introduction of knowledge into its own scope (i. implicitly, as goodness contrasted with blind rule-following ii. explicitly qua knowledge) while the development of the dual peri tinos (“----about what?) question leads to K’s elimination from its own scope. The introductions are motivated to avoid contradiction, but produce regress; the eliminations are motivated to avoid regress, but produce contradiction. In scholarship, and in the history of philosophy, the ti esti question is universally recognized, to the point of being identified with philosophy’s origin and essence; the peri tinos question is neglected textually and never recognized as the equal dual to the ti esti. This, I claim, has blocked the development of a nontrivial logical appreciation of what Plato's Socrates is up to. (One rather disastrous effect of this neglect is taking Aristotle as the beginning of the development of logic, rather than, correctly, for the beginning of logic’s fatal separation from mathematics and dialectic.) -/- Further, because of this monopticism of the ti esti, the function of consistency in the elenchos has not been understood, even with respect to the ti esti. The ti esti is actually in search of completeness, given a norm of consistency; the peri tinos is in search of consistency, given a norm of completeness. Only appreciating the two questions as dual allows space in the structure to clarify these different orientations relative to consistency. (And, dually, to completeness, whose function in the elenchos is generally entirely missed by scholars and relegated to discussions of eros; it's not out of place there, of course, but its significance is secured here.) Recognizing the duality of the ti esti and peri tinos questions is thus the royal road, in the Socratic-Platonic context, to catching sight of what we post-Cantorians can recognize as the metalogical duality of consistency and completeness. (The salutary disruptive effects of this Plato-Cantor proximity have, of course, been traced in complementary ways by Badiou.) -/- Note that the diagram is supposed to provide a relatively accessible orientation, not to stand on its own, and certainly not to be the last word on any subject. An important qualification (telegraphed in the previous paragraph) is that what elenchos shows is not finally circular or paradoxical, though the problem first presents as such (stubbornly, obdurately, as "difficult" Plato's Socrates always says with characteristic understatement). What is depicted here is meant, at a first pass, to be the shape of that first presentation, the form of the problem of elenchos, rather than of its solution. It's not an accident that this problem strongly resembles "Russell's paradox" (not Russell's not a paradox.) Problem is to solution as RP is to the diagonal theorems. (shrink)

A large number of cross-references to various bodies of text are used in legal texts, each serving a different purpose. It is often necessary for authorities and companies to look into certain types of these citations. Yet, there is a lack of automatic tools to aid in this process. Recently, citation graphs have been used to improve the intelligibility of complex rule frameworks. We propose an algorithm that builds the citation graph from a document and automatically labels each edge (...) according to its purpose. Our method uses the citing text only and thus works only on citations who’s purpose can be uniquely identified by their surrounding text. This framework is then applied to the US code. This paper includes defining and evaluating a standard gold set of labels that cover a vast majority of citation types which appear in the “US Code” but are still short enough for practical use. We also proposed a novel linear-chain conditional random field model that extracts the features required for labeling the citations from the surrounding text. We then analyzed the effectiveness of different clustering methods such as K-means and support vector machine to automatically label each citation with the corresponding label. Besides this, we talk about the practical difficulties of this task and give a comparison of human accuracy compared to our end-to-end algorithm. (shrink)

This is Part B of an article that defends non-eliminative structuralism about mathematics by means of a concrete case study: a theory of unlabeled graphs. Part A motivated an understanding of unlabeled graphs as structures sui generis and developed a corresponding axiomatic theory of unlabeled graphs. Part B turns to the philosophical interpretation and assessment of the theory: it points out how the theory avoids well-known problems concerning identity, objecthood, and reference that have been attributed to (...) non-eliminative structuralism. The part concludes by explaining how the theory relates to set theory, and what remains to be accomplished for non-eliminative structuralists. (shrink)

A framework for “improvisational” social acts and communication is introduced by referring to the idea of “relationalism” such as natural farming, permaculture and deep ecology. Based on this conception, the notion of Existential Graph by C. S. Peirce is introduced. The notion of extended self in deep ecology is substantiated based on the Roy Adaptation Model in Nursing Theory and Narrative approaches. By focusing on Leibnizian notions of space and time and by introducing Petri net, a spatio-temporal model of improvisation (...) is constructed. This model is expected to substantiate the interesting notion of “Ba” proposed by H. Shimizu reflecting Japanese culture. (shrink)

The scale of know­ledge is growing rapidly in the big data environment, and traditional know­ledge organization and services have faced the dilemma of semantic inaccuracy and untimeliness. From a know­ledge fusion perspective-combining the precise semantic superiority of traditional ontology with the large-scale graph processing power and the predicate attribute expression ability of property graph-this paper presents an ontology and property graph fusion framework (OPGFF). The fusion process is divided into content layer fusion and constraint layer fusion. The result of the (...) fusion, that is, the know­ledge representation model is called know­ledge big graph. In addition, this paper applies the know­ledge big graph model to the ownership network in the China’s financial field and builds a financial ownership know­ledge big graph. Furthermore, this paper designs and implements six consistency inference algorithms for finding contradictory data and filling in missing data in the financial ownership know­ledge big graph, five of which are completely domain agnostic. The correctness and validity of the algorithms have been experimentally verified with actual data. The fusion OPGFF framework and the implementation method of the know­ledge big graph could provide technical reference for big data know­ledge organization and services. (shrink)

The purpose of this paper is to open for investigation a range of phenomena familiar from dynamical systems or chaos theory which appear in a simple fuzzy logic with the introduction of self-reference. Within that logic, self-referential sentences exhibit properties of fixed point attractors, fixed point repellers, and full chaos on the [0, 1] interval. Strange attractors and fractals appear in two dimensions in the graphing of pairs of mutually referential sentences and appear in three dimensions in the graphing (...) of mutually referential triples. (shrink)

A general principle for good pedagogic strategy is this: other things equal, make the essential principles of the subject explicit rather than tacit. We think that this principle is routinely violated in conventional instruction in statistics. Even though most of the early history of probability theory has been driven by causal considerations, the terms “cause” and “causation” have practically disappeared from statistics textbooks. Statistics curricula guide students away from the concept of causality, into remembering perhaps the cliche disclaimer “correlation does (...) not mean causation,” but rarely thinking about what correlation does mean. The treatment of causality is a serious handicap to later studies of such topics as experimental design, where often the main goal is to establish (or disprove) causation. Much of the technical vocabulary of the language used in research design textbooks consists in euphemisms for specific causal relations, e.g, “latent variable,” “intervening variable,” “confounding factor,” etc. The multiplicity of terms used to refer to causation results in confusion and, in effect, may hinder understanding of the basic principles of research design. (shrink)

The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality -- these are the so-called "dangerous" directed graphs. Building on Rabern, et. al (2013) we reformulate this problem in terms of fixed points of certain functions, thereby boiling it (...) down to get a purely mathematical problem. (shrink)

This book is a contribution to the flourishing field of formal and philosophical work on truth and the semantic paradoxes. Our aim is to present several theories of truth, to investigate some of their model-theoretic, recursion-theoretic and proof-theoretic aspects, and to evaluate their philosophical significance. In Part I we first outline some motivations for studying formal theories of truth, fix some terminology, provide some background on Tarski’s and Kripke’s theories of truth, and then discuss the prospects of classical type-free truth. (...) In Chapter 4 we discuss some minimal adequacy conditions on a satisfactory theory of truth based on the function that the truth predicate is intended to fulfil on the deflationist account. We cast doubt on the adequacy of some non-classical theories of truth and argue in favor of classical theories of truth. Part II is devoted to grounded truth. In chapter 5 we introduce a game-theoretic semantics for Kripke’s theory of truth. Strategies in these games can be interpreted as reference-graphs of the sentences in question. Using that framework, we give a graph-theoretic analysis of the Kripke-paradoxical sentences. In chapter 6 we provide simultaneous axiomatizations of groundedness and truth, and analyze the proof-theoretic strength of the resulting theories. These range from conservative extensions of Peano arithmetic to theories that have the full strength of the impredicative system ID1. Part III investigates the relationship between truth and set-theoretic comprehen- sion. In chapter 7 we canonically associate extensions of the truth predicate with Henkin-models of second-order arithmetic. This relationship will be employed to determine the recursion-theoretic complexity of several theories of grounded truth and to show the consistency of the latter with principles of generalized induction. In chapter 8 it is shown that the sets definable over the standard model of the Tarskian hierarchy are exactly the hyperarithmetical sets. Finally, we try to apply a certain solution to the set-theoretic paradoxes to the case of truth, namely Quine’s idea of stratification. This will yield classical disquotational theories that interpret full second-order arithmetic without set parameters, Z2- . We also indicate a method to recover the parameters. An appendix provides some background on ordinal notations, recursion theory and graph theory. (shrink)

How many words—and which ones—are sufficient to define all other words? When dictionaries are analyzed as directed graphs with links from defining words to defined words, they reveal a latent structure. Recursively removing all words that are reachable by definition but that do not define any further words reduces the dictionary to a Kernel of about 10% of its size. This is still not the smallest number of words that can define all the rest. About 75% of the Kernel (...) turns out to be its Core, a “Strongly Connected Subset” of words with a definitional path to and from any pair of its words and no word's definition depending on a word outside the set. But the Core cannot define all the rest of the dictionary. The 25% of the Kernel surrounding the Core consists of small strongly connected subsets of words: the Satellites. The size of the smallest set of words that can define all the rest—the graph's “minimum feedback vertex set” or MinSet—is about 1% of the dictionary, about 15% of the Kernel, and part-Core/part-Satellite. But every dictionary has a huge number of MinSets. The Core words are learned earlier, more frequent, and less concrete than the Satellites, which are in turn learned earlier, more frequent, but more concrete than the rest of the Dictionary. In principle, only one MinSet's words would need to be grounded through the sensorimotor capacity to recognize and categorize their referents. In a dual-code sensorimotor/symbolic model of the mental lexicon, the symbolic code could do all the rest through recombinatory definition. (shrink)

Notoriously, the dispositional view of natural properties is thought to face a number of regress problems, one of which points to an epistemological worry. In this paper, I argue that the rival categorical view is also susceptible to the same kind of regress problem. This problem can be overcome, most plausibly, with the development of a structuralist epistemology. After identifying problems faced by alternative solutions, I sketch the main features of this structuralist epistemological approach, referring to graph-theoretic modelling in the (...) process. Given that both the categoricalists and dispositionalists are under pressure to adopt this same epistemological approach in light of the regress problem, this suggests that the categoricalist versus dispositionalist debate is best fought on metaphysical rather than epistemological grounds. (shrink)

We propose an efficient algorithm for deciding the reachability between any nodes on XML data represented by connected directed graphs. We develop a technique to reduce the size of the reference table for the reachability test. Using the small table and the standard range labeling method for rooted ordered trees, we show that our algorithm answers almost queries in a constant time preserving the space efficiency and a reasonable preprocessing time.

Inferential Role Semantics is often criticized for being incompatible with the platitude that words of different speakers can mean the same thing. While many assume that this platitude can be accommodated by understanding sameness of meaning in terms of similarity of meaning, no worked out proposal has ever been produced for Inferential Role Semantics. I rectify this important omission by giving a detailed structural account of meaning similarity in terms of graph theory. I go on to argue that this account (...) has a number of attractive features, prominent among them that it makes sameness of meaning probabilistically determine co-reference. (shrink)

In many fields in the life sciences investigators refer to downward or top-down causal effects. Craver and Bechtel defended the view that such cases should be understood in terms of a constitution relation between levels in a mechanism and causation as solely an intra-level relation. Craver and Bechtel, however, provided insufficient specification as to when entities constitute a higher-level mechanism. In this paper I appeal to graph-theoretic representations of networks that are now widely employed in systems biology and neuroscience to (...) identify mechanisms with the modules that exhibit high clustering. As a result of the interconnections of nodes in these modules/mechanisms, they often exhibit complex dynamic behaviors that constrain how the individual components respond to external inputs, an important feature of cases viewed as involving top-down causation. (shrink)

It is widespread that the consumers browse relevant reviews for reference before purchasing the products when online shopping. Some stores or users may write deceptive reviews to mislead consumers into making risky purchase decisions. Existing methods of deceptive review detection did not consider the valid product review sets and classification probability of feature weights. In this research, we propose a deceptive review detection algorithm based on the target product identification and the calculation of the Metapath feature weight, noted as (...) TM-DRD. The review dataset of target product is modeled as a heterogeneous review information network with the feature nodes. The classification method of graph is used to detect the deceptive reviews, which can improve the efficiency and accuracy of deceptive review detection due to the sparsity, imbalance of deceptive reviews, and the absence of category probability of feature weight calculation. The TM-DRD algorithm we proposed is validated on the real review dataset Yelp and compared with the SpEagle, NFC, and NetSpam algorithm. The experiment results demonstrate that the TM-DRD algorithm performs better than the other method with regard to the accuracy and efficiency. (shrink)

Many types of everyday and specialized reasoning depend on diagrams: we use maps to find our way, we draw graphs and sketches to communicate concepts and prove geometrical theorems, and we manipulate diagrams to explore new creative solutions to problems. The active involvement and manipulation of representational artifacts for purposes of thinking and communicating is discussed in relation to C.S. Peirce’s notion of diagrammatical reasoning. We propose to extend Peirce’s original ideas and sketch a conceptual framework that delineates different (...) kinds of diagram manipulation: Sometimes diagrams are manipulated in order to profile known information in an optimal fashion. At other times diagrams are explored in order to gain new insights, solve problems or discover hidden meaning potentials. The latter cases often entail manipulations that either generate additional information or extract information by means of abstraction. Ideas are substantiated by reference to ethnographic, experimental and historical examples. (shrink)

It is not only difficult to be a sports expert but also difficult to grow from a sports expert to a sports elite. Professional athletes are often concerned about the differences between an expert and an elite and how to eventually become an elite athlete. To explore the differences in brain neural mechanism between experts and elites in the process of motor behavior and reveal the internal connection between motor performance and brain activity, we collected and analyzed the electroencephalography findings (...) of 14 national archers and 14 provincial archers during aiming and resting states and constructed the EEG brain network of the two archer groups based on weighted phase lag index; the graph theory was used to analyze and compare the network characteristics via local network and global network topologies. The results showed that compared with the expert archers, the elite archers had stronger functional coupling in beta1 and beta2 bands, and the difference was evident in the frontal and central regions; in terms of global characteristics of brain network topology, the average clustering coefficient and global efficiency of elite archers were significantly higher than that of expert archers, and the eigenvector centrality of expert archers was higher; for local characteristics, elite archers had higher local efficient; and the brain network characteristics of expert archers showed a strong correlation with archery performance. This suggests that compared with expert archers, elite archers showed stronger functional coupling, higher integration efficiency of global and local information, and more independent performance in the archery process. These findings reveal the differences in brain electrical network topologies between elite and expert archers in the archery preparation stage, which is expected to provide theoretical reference for further training and promotion of professional athletes. (shrink)

According to Woodward’s influential account of explanation, explanations have a counterfactual structure, and explanatory counterfactuals are analysed in terms of causal relations and interventions. In this paper, we provide a formal semantics of explanatory counterfactuals based on a Ramsey Test semantics of conditionals. Like Woodward’s account, our account is guided by causal considerations. Unlike Woodward’s account, it makes no reference to causal graphs and it also covers cases of explanation where interventions are impossible.

This theoretical paper considers the morality of machine learning algorithms and systems in the light of the biases that ground their correctness. It begins by presenting biases not as a priori negative entities but as contingent external referents—often gathered in benchmarked repositories called ground-truth datasets—that define what needs to be learned and allow for performance measures. I then argue that ground-truth datasets and their concomitant practices—that fundamentally involve establishing biases to enable learning procedures—can be described by their respective morality, here (...) defined as the more or less accounted experience of hesitation when faced with what pragmatist philosopher William James called “genuine options”—that is, choices to be made in the heat of the moment that engage different possible futures. I then stress three constitutive dimensions of this pragmatist morality, as far as ground-truthing practices are concerned: the definition of the problem to be solved, the identification of the data to be collected and set up, and the qualification of the targets to be learned. I finally suggest that this three-dimensional conceptual space can be used to map machine learning algorithmic projects in terms of the morality of their respective and constitutive ground-truthing practices. Such techno-moral graphs may, in turn, serve as equipment for greater governance of machine learning algorithms and systems. (shrink)

THE ART OF CAUSAL CONJECTURE Glenn Shafer Table of Contents Chapter 1. Introduction........................................................................................ ...........1 1.1. Probability Trees..........................................................................................3 1.2. Many Observers, Many Stances, Many Natures..........................................8 1.3. Causal Relations as Relations in Nature’s Tree...........................................9 1.4. Evidence............................................................................................ ...........13 1.5. Measuring the Average Effect of a Cause....................................................17 1.6. Causal Diagrams..........................................................................................20 1.7. Humean Events............................................................................................23 1.8. Three Levels of Causal Language................................................................27 1.9. An Outline of the Book................................................................................27 Chapter 2. Event Trees............................................................................................... .....31 2.1. Situations and Events...................................................................................32 2.2. The Ordering of Situations and Moivrean Events.......................................35 2.3. Cuts................................................................................................ ..............39 2.4. Humean Events............................................................................................43 2.5. (...) Moivrean Variables......................................................................................49 2.6. Humean Variables........................................................................................53 2.7. Event Trees for Stochastic Processes...........................................................54 2.8. Timing in Event Trees.................................................................................56 2.9. Intersecting Event Trees...............................................................................60 2.10. Notes on the Literature...............................................................................61 Chapter 3. Probability Trees...........................................................................................63 3.1. Some Types of Probability Trees.................................................................64 ii 3.2. Axioms for the Probabilities of Moivrean Events.......................................68 3.3. Zero Probabilities....................................................................................... ..70 3.4. A Sample-Space Analysis of the Event-Tree Axioms.................................72 3.5. Probabilities and Expected Values for Variables.........................................74 3.6. Martingales......................................................................................... .........79 3.7. The Expectation of a Variable in a Cut........................................................83 3.8. Conditional Expected Value and Conditional Expectation.........................87 Chapter 4. The Meaning of Probability...........................................................................91 4.1. The Interpretation of Expected Value..........................................................92 4.2. The Interpretation of Expectation................................................................95 4.3. The Long Run..............................................................................................98 4.4. Changes in Belief.........................................................................................101 4.5. The Empirical Validation of Probability......................................................106 4.6. The Diversity of Uses of Probability...........................................................108 4.7. Notes on the Literature.................................................................................110 Chapter 5. Independent Events.......................................................................................113 5.1. Independence........................................................................................ .......114 5.2. Weak Independence.....................................................................................118 5.3. The Principle of the Common Cause...........................................................121 5.4. Conditional Independence............................................................................128 5.5. Notes on the Literature.................................................................................133 Chapter 6. Events Tracking Events.................................................................................135 6.1. Tracking............................................................................................ ...........137 6.2. Tracking and Conditional Independence.....................................................142 6.3. Stochastic Subsequence...............................................................................143 6.4. Singular Diagrams for Stochastic Subsequence...........................................147 6.5. Conjunctive and Interactive Forks...............................................................149 Chapter 7. Events as Signs of Events..............................................................................153 iii 7.1. Sign................................................................................................ ..............154 7.2. Weak Sign................................................................................................ ....159 7.3. The Ethics of Causal Talk............................................................................160 7.4. Screening Off...............................................................................................16 2 Chapter 8. Independent Variables...................................................................................167 8.1. Unconditional Independence........................................................................170 8.2. Conditional Independence............................................................................175 8.3. Independence for Partitions.........................................................................177 8.4. Independence for Families of Variables......................................................182 8.5. Individual Properties of the Independence Relations...................................186 Chapter 9. Variables Tracking Variables........................................................................189 9.1. Tracking and Conditional Independence: A Summary...............................190 9.2. Strong Tracking............................................................................................ 192 9.3. Strong Tracking and Conditional Independence..........................................198 9.4. Stochastic Subsequence...............................................................................201 9.5. Functional Dependence................................................................................203 9.6. Tracking in Mean.........................................................................................204 9.7. Linear Tracking............................................................................................ 207 9.8. Tracking by Partitions..................................................................................210 9.9. Tracking by Families of Variables...............................................................212 Chapter 10. Variables as Signs of Variables...................................................................215 10.1. Sign................................................................................................ ............219 10.2. Linear Sign................................................................................................ .222 10.3. Scored Sign................................................................................................ 225 10.4. Families of Variables.................................................................................227 Chapter 11. AnTheory of Event Trees.............................................................229 11.1. Event Trees as Sets of Sets........................................................................230 11.2. Event Trees as Partially Ordered Sets........................................................232 iv 11.3. Regular Event Trees...................................................................................240 11.4. The Resolution of Moivrean Variables......................................................244 11.5. Humean Events and Variables...................................................................246 Chapter 12. Martingale Trees..........................................................................................247 12.1. Examples of Decision Trees......................................................................249 12.2. The Meaning of Probability in a Decision Tree.........................................253 12.3. Martingales......................................................................................... .......257 12.4. The Structure of Martingale Trees.............................................................261 12.5. Probability and Causality...........................................................................265 12.6. Lower and Upper Probability.....................................................................269 12.7. The Law of Large Numbers.......................................................................272 12.8. Notes on the Literature...............................................................................274 Chapter 13. Refining............................................................................................ ...........275 13.1. Examples of Refinement............................................................................277 13.2. A Constructive Definition of Finite Refinement.......................................281 13.3. Axioms for Refinement..............................................................................282 13.4. Lifting Moivrean Events and Variables.....................................................288 13.5. Refining Martingale Trees.........................................................................288 13.6. Grounding........................................................................................... .......294 Chapter 14. Principles of Causal Conjecture..................................................................299 14.1. The Diversity of Causal Explanation.........................................................302 14.2. The Mean Effect of the Happening of a Moivrean Event..........................305 14.3. The Effect of a Humean Variable..............................................................311 14.4. Attribution and Generality.........................................................................316 14.5. The Statistical Measurement of the Effect of a Cause...............................319 14.6. Measurement by Experiment.....................................................................320 14.7. Using Our Knowledge of How Things Work............................................322 v 14.8. Sampling Error...........................................................................................329 14.9. The Sampling Frame..................................................................................329 14.10. Notes on the Literature.............................................................................330 Chapter 15. Causal Models.............................................................................................3 31 15.1. The Causal Interpretation of Statistical Prediction....................................333 15.2. Generalizing to a Family of Exogenous Variables....................................337 15.3 Some Joint Causal Diagrams......................................................................339 15.4. Causal Path Diagrams................................................................................342 15.5. Causal Relevance Diagrams.......................................................................346 15.6. The Meaning of Latent Variables..............................................................352 15.7. Notes on the Literature...............................................................................357 Chapter 16. Representing Probability Trees...................................................................359 16.1. Three Graphical Representations...............................................................361 16.2. Skeletal Simplifications.............................................................................368 16.3. Martingale Trees in Type Theory...............................................................371 Appendix A. Huygens’s Probability Trees.....................................................................379 Huygens’s Manuscript in Translation..................................................................380 Appendix B. Some Elements of Graph Theory..............................................................385 B1. Undirected Graphs........................................................................................385 B2. Directed Graphs............................................................................................386 Appendix C. Some Elements of Order Theory...............................................................393 C1. Partial and Quasi Orderings.........................................................................393 C2. Singular and Joint Diagrams for Binary Relations.......................................394 C3. Lattices............................................................................................ .............395 C4. The Lattice of Partitions of a Set..................................................................396 Appendix D. The Sample-Space Framework for Probability.........................................399 D1. Probability Measures....................................................................................399 D2. Variables........................................................................................... ...........400 vi D3. Families of Variables...................................................................................401 D4. Expected Value............................................................................................402 D5. The Law of Large Numbers.........................................................................405 D6. Conditional Probability................................................................................406 D7. Conditional Expected Value........................................................................407 Appendix E. Prediction in Probability Spaces................................................................409 E1. Conditional Distribution...............................................................................411 E2. Regression on a Single Variable...................................................................412 E3. Regression on a Partition or a Family of Variables......................................415 E4. Linear Regression on a Single Variable.......................................................418 E5. Linear Regression on a Family of Variables................................................422 Appendix F. Sample-Space Concepts of Independence.................................................425 F1. Overview............................................................................................ ...........426 F2. Independence Proper.....................................................................................432 F3. Unpredictability in Mean..............................................................................434 F4. Simple Uncorrelatedness..............................................................................437 F5. Mixed Uncorrelatedness...............................................................................438 F6. Partial Uncorrelatedness...............................................................................440 F7. Independence for Partitions..........................................................................442 F8. Independence for Families of Variables.......................................................445 F9. The Basic Role of Uncorrelatedness.............................................................448 F10. Dawid’s Axioms.........................................................................................449 Appendix G. Prediction Diagrams..................................................................................453 G1. Path Diagrams............................................................................................ ..454 G2. Generalized Path Diagrams..........................................................................462 G3. Relevance Diagrams.....................................................................................466 G4. Bubbled Relevance Diagrams......................................................................475 Appendix H. Abstract Stochastic Processes...................................................................479 vii H1. Probability Conditionals and Probability Distributions...............................477 H2. Abstract Stochastic Processes......................................................................479 H3. Embedding Variables and Processes in a Sample Space.............................480 References.......................................................................................... ..............................491. (shrink)

continent. 1.2 (2011): 70-75. cartography of ghosts . . . And as a way to talk . . . of temporality the topography of imagination, this body whose dirty entry into the articulation of history as rapturous becoming & unbecoming, greeted with violence, i take permission to extend this grace —Akilah Oliver from “An Arriving Guard of Angels Thusly Coming To Greet” Our disappearance is already here. —Jacques Derrida, 117 I wrestled with death as a threshold, an aporia, a bandit, (...) a part of life. —Akilah Oliver Moraine in geological lingo is that which is left behind. Moraine- a euphemism for the de-stabilizing referent of the writer-ly body as a “troubled and troubling landscape marked by cultural and historical signifiers, the body as flesh memory [...] the body as transitory” (Oliver, Author Statement). Moraine— a geological metaphor of the poet as a holder of memory, as an accumulation of rocks and debris carried along the edge, terminal, dropped at the foot of language (in language). “Flesh Memory” according to Akilah Oliver is "that which my body recalls [...] everything has to do with the task of remembrance and its narrative reinvention [...] I was always translating an idea of the world as it presented itself at any given time. To write was a choice about how to be seen, how to enter the world as translator, actor, participant, in the dialogues that apparently made the real 'real'" (Levitsky). Flesh. Memory. The stuff some poems are made from. The stuff that gets abandoned, gleaned, and picked up by more flesh and memory. "My body, my life has always felt like a kaleidoscopic rip in the dominant fabric [...] has always been a dialogue with the impossible and the apparent” (Levitsky). The impossible-body or poet's body anticipates and performs (through language) an irretrievable death. IN APORIA I realized everything I must have been doing must have been Death. It was Christmas or Labor Day—a holiday—and every time you turned on the radio they said something like ‘four million’ or ‘going to die’.” — Andy Warhol I’m trying on egos, [a justification for the planet’s continuance]. Oh hello transgressor, you’ve come to collect utilitarian debts, humbling narrative space. Give me condition and wheatgrass, I his body disintegrating. I his body is ossification. Death my habit radius, yeah yeah. I his body can’t refuse this summons. I can’t get out this fucking room. Tell me something different about torture dear Trickster. Tell me about the lightness my mother told me to pick the one i love the best how it signals everything I ever wish to believe true just holy on my ship. I jump all over this house. this is it [what I thought is thought only, nothing more deceptive than]: I his body keeps thinking someone will come along, touch me. As like human or lima bean. I’m cradling you to my breast, you are looking out. A little wooden lion you & Peter carve on Bluff Street is quieting across your cheekbone. Not at all like the kind of terror found in sleep, on trembling grounds. It is yesterday now. I have not had a chance to dance in this century. Tonight I shall kill someone, a condition to remember Sunday morning. To think of lives as repetitions [rather than singular serial incarnations]. To understand your death is as exacerbating as trying to figure out why as schoolchildren in mid-nineteen-sixties Southern California we performed reflexive motions: cutting out lace snowflakes, reading Dick and Jane search for their missing mittens, imagining snow. Disintegrat ing . The -ing gerund catapults from the non-finite verb into past, present, future. The -ing as a tail pinned to death, a dog spinning to bite and never fully reaching itself, always shy of the end, circumreferential; a double copulative: deathing. Possessively AO calls it “habit radius” (a virtual fetish attribute) or an inescapable death presence that “confronts us with the paradox of an unattainable object [...] through it’s being unattainable” (Agamben, 27). A flirtation or dialogue with an unknowable thing and aporia utilized as investigative instrument to engage (death) while (in Southern California) we “perform reflexive motions,” cut lace snowflakes, imagine snow, and pay rent like “yeah, yeah” what else is new. And this too, fiction. The book I wish to right. The restored fallen, heroic. Did you expect a different grace from the world? Or upon exit? I’m working on “tough.” They think I am already. All ready. Who is the dead person? Is "I'm sorry" real to a dead person? Browning grass. My hands on this table. A contentious century. A place to pay rent. Redemptive moments. Am I now the dead person? Dead person, dead person, will you partake in my persimmon feast? The body inside the body astounds, confesses sins of the funhouse. I too have admired the people of this planet. Their frilly, orderly intellects. The use they’ve made of cardamom, radiation as well. How they’ve pasteurized milk, loaned surnames to stars, captured tribes, diseases, streets, and ideas too. The living-body as archive: is it possible to experience the living-body as archive without a (kind of) death? Sifting the rubble, rummaging through hoarded debris, skin sheds, memory-napping, and re-awoken (in flesh and) on terrain. “An investigative poetics seeks to unravel staid communities of thought and grasp at what might always be just beyond reach; a poetics of inquiry that lies between language as meaning, and language as rapturous entry into the world of posited ideas and idealism”( Levitsky). Something snaps. Lights blow out prior to embarking upon an investigative poetics. It begins with a question (often a sexy aporia) that leads to openings. "Every politics of memory [...] implies an intervention of the state. It's a state that legislates and acts with regard to the nonfinite mass of materials to be stored, materials which must be collected, preserved” (Derrida & Stiegler, 62). It seems poetic investigation already contains the potentiality of an (invisible) archive if the writer is “always writing” especially when not. Here’s my stupid digital romantic inclination: the living-body (of a poet) is a self-sustaining archive of non-finite memories. But not even I really believe that. AO innovated and sculpted an investigative poetic praxis. In a conversation with poet Rachel Levitsky, poetic-voice is viewed not as a precious identifier, but as a means to think through/about form, concluding that form is linked to framing. While poetic-voice may have tendency to precede form, it also erupts as a result of framing techniques. “They are frames that hold the shape of thinking (which is also to say of imagining) [...].”7 This reminds me of my rabbit who symmetrically chewed the corners of his hutch, which makes me wonder if it’s an expression of the shape of some animal anxiety tick I won’t ever have access to. Beyond the form/frame, death is an unoriginal yet unique limit; death is a damn deathless thing. It functions as a source of poetic investigation; that thing always “just beyond reach.” And how is death not a fetish (in this case an obsessive reverence for something non-material)? “Insofar as it [death] is a presence, a fetish [...] it is in fact something concrete and tangible; but insofar as it is the presence of an absence, it is, at the same time, immaterial and intangible, because it alludes continuously beyond itself to something that can never really be possessed [...] The fetish is [...] a sign of an absence, it is not an unrepeatable unique object; on the contrary, it is something infinitely capable of substitution, without any successive incarnations ever succeeding in exhausting the nullity of which it is the symbol” (Agamben, 33). AO utilized absence (the absent body [catapulted by the death of a beloved]) as an apparatus to investigate. In the process of conversing with absence or that which is absent, the absent body is affectionately objectified, incessantly summonsed back to a place of recognition, of objects, a desire for the absent body to remain intact while exiting the structural limits of grammar and syntax by moving into chant forms “to say what cannot be said” (Levitsky). from AN ARRIVING GUARD OF ANGELS THUSLY COMING TO GREET dear oluchi- the light is blinking rapidly on the black boxy machine. your room seems bigger than before and i am still planning to read some of those robert jordan books of yours. yesterday at the used bookstore where i was browsing the mysteries to “stall reality” (they are really not mysteries at all, they just employ death as the plot mistress but are unable to grasp its mystery at all)—well the point is, things were calm down here for a while and the world was little. i want to be big like you. or i want you not vast, not dead, not gone, but human small and here. i am so selfish. that is what i really want. to see you again. to oil your scalp. to hear you walk in the door, say ma i’m home . give me a chance to say welcome home son. or when leaving, don’t forget your hat . what do you wear out there? i wish you could have taken your new shoes with you. i’m so proud of you. i’m sorry for the way you died. i miss you all the time. even before, i missed you. out there, one time, some different men said: “shake for me girl, i wanna be your backdoor man.” who dat you love. 5/18/03 A letter-poem in sixteen lines “dear oluchi-” is safe-housed in epistolary form. Poetic voice is rendered as internal thought meanderings, a not-so-much confession, private/(pillow?) talk in the desire to be heard/witnessed by the referent and reader with an intent to absolve. The diminutive “i” bears a relation to poet Fanny Howe’s “little g God” in that “One of the (many) things I like about little g God is that you can have a vodka tonic while you talk to little g God, sing along to Bowie’s “I’m Afraid Of Americans,” and hum Coltrane’s “A Love Supreme,” though maybe not all at the same time” (Oliver, 2009). Towards the middle of the poem AO is at a used bookstore and remarks on the funny employment of death as a ‘plot mistress’ that ‘they’ (the dubious employed mystery authors) are ‘unable to grasp’, thereby giving death a mouthpiece, a modeling job, something to do to pass the time. from THE VISIBLE UNSEEN When I first saw graffiti, I recognized in it an ugly aesthetic, a dialectics of violence, a distortion of limbs, a hieroglyph. It was only later when I read the names of the dead that I then saw the path of ghosts charted there; its narrative of loss for the visible unseen whose place in history has been fictionalized and rendered unseen under the totalizing glare of history. Inscriptions, traces, specters. Graffiti begs a public face just as ghosts require non-ghosts (humans) to sense them. The “visible unseen” is a game of hide-and-seek between public viewer and graffiti-inscriber, an ephemeral-violent aesthetic on an ephemeral-policed canvas. Graffiti-inscribers already submit to being forgotten, expect to be washed away; perhaps it’s a holy urban mandala created by gangster-type monks without Buddhism. [...] in its refusal to disappear it forces a discourse in the public imagination we are forced to see what we would rather not, to make sense of an encoded language that we cannot read on the level of meaning. it irritates, forces its agency on us, speaks outside and beyond semiotic reach. An epic font-size pervading the public’s imagination, illegible, I could just close my eyes, remain passive, drive past, abandon it beyond reach, push it further away beyond death walls. In Barcelona I watched a clean up crew wash walls with an awesome water hose but I was more intrigued by their bodies; not a distortion of limbs, not hieroglyph but also not entirely legible; the laboring body permanently erasing specters of the city, and of course they knew it was also an invitation for the ghosts to return. Graffiti is death’s little sister, is also an aporia. [...] Graffiti (fr GK -graph(os), something drawn or written, to diagram or chart) attempts to stage the impossible: to erase the essence of its own subjectivity. Graffiti is a cartography of ghosts, a mapping of elegiac rapture (the transporting of a person from one place to another, as in heaven) and rupture (the state of being broken open.) Dwelling is a fiction stasis. [...] The notion of the past as being something done with, a look-back event, inhibits the possibility of reading graffiti as rapture, as rupture. If graffiti posits history as always in the process of becoming undone. [...] Because what is the body, if not also a complex temple, an unstable site through which to negotiate subjects, materiality, economies, gods, and modes of representations? The site where we are all already belated. Graphein meaning “to write.” “Derrida says every archive makes a law, and the law of genre is its own rupture” (Bloch, 39). However, graffiti is an (non/anti)-archive of erasure due to (the politics of) washing out its subjectivity, which only adds onto (or is symptomatic of) its character. The inhibition of “reading graffiti as rapture, as rupture” is partly due to it being a “look-back” event in that it’s process involves scratching through layers to reveal previous specters underneath. Graffiti (as an ancient genre) has always been a thing of ‘becoming undone’, and therefore ‘belated and always in arrival’ (Levitsky). It’s a Dionysian activity done at night with it’s back turned toward us. "The specter [...] is of the visible, but of the invisible visible, it is the visibility of a body which is not present in flesh and blood [...] appearing for vision, to the brightness of day [...] something becomes almost visible which is visible only insofar as it is not visible in flesh and blood. It is a night visibility. As soon as there is a technology of the image, visibility brings night. It incarnates in a night body, it radiates in a night light" (Derrida & Stiegler, 115). (shrink)

Context: Technology has not only changed the way we teach mathematical concepts but also the nature of knowledge, and thus what is possible to learn. While geometric transformations are recognized to be foundational to the formation of students’ geometric conceptions, little research has focused on how these notions can be introduced in elementary schooling. Problem: This project addressed the need for development of students’ reasoning about and with geometric transformations in elementary school. We investigated the nature of students’ understandings of (...) translations, rotations, scaling, and stretching in two dimensions in the context of use of the software application Graphs ’n Glyphs. More specifically, we explored the question “What is the nature of elementary students’ reasoning of geometric transformations when instruction exploits the technological tool Graphs ’n Glyphs?” Method: Using a design research perspective, we present the conduct of a teaching experiment with one pair of fourth-graders, studying translation and rotation. The project investigated how and to what extent activity using Graphs ’n Glyphs can elicit students’ reasoning about geometric transformations, and explored the constraints and affordances of Graphs ’n Glyphs for thinking-in-change about geometric transformations. Results: The students proved adept using the software with carefully designed tasks to explore the behavior of two-dimensional shapes, distinguish among transformations, and develop predictions. In relation to varied conditions of transformations, they formed generalizations about the way a shape behaves, including the use of referent points in predicting outcomes of translations, and recognizing the role of the center of rotation. Implications: The generalizations that the students developed are foundational for developing an understanding of the properties of transformations in the later years of schooling. Dynamic technological approaches to geometry may prove as valuable to elementary students’ understanding of geometry as it is for older students. Constructivist content: This study contributes to ongoing constructivism/constructionism conversations by concentrating on the transformation of ideas when engaging learners in activity through particular contexts and tools. Key Words: Geometry, transformations, constructionist technologies. (shrink)

A mapping of a finite directed graph onto a curve in space-time is considered. The mapping induces the dynamics of a free particle moving along the curve. The distinction between the Lagrangian and the Hamiltonian formulation of particle mechanics is expressed in terms of the distinction between referring to a particle in space and time and referring to the points in space which the particle occupies, respectively. These elements are combined to yield an interpretation of Feynman's path integral formulation of (...) quantum mechanics. Describing a bound state of a system as a particle is discussed. (shrink)

When the German mathematician Hermann Minkowski first introduced the space-time diagrams that came to be associated with his name, the idea of picturing motion by geometric means, holding time as a fourth dimension of space, was hardly new. But the pictorial device invented by Minkowski was tailor-made for a peculiar variety of space-time: the one imposed by the kinematics of Einstein’s special theory of relativity, with its unified, non-Euclidean underlying geometric structure. By plo tting two or more reference frames (...) in relative motion on the same picture, Minkowski managed to exhibit the geometric basis of such relativistic phenomena as time dilation, length contraction or the dislocation of simultaneity. These disconcerting effects were shown to result from arbitrary projections within four-dimensional space-time. In that respect, Minkowski diagrams are fundamentally different from ordinary space-time graphs. The best way to understand their specificity is to realize how productively ambiguous they are. (shrink)

Differential leadership as a localized leadership style gradually developed on the basis of the Pattern of Differential Sequence. It plays a dual role in stimulating “insider subordinates” and “outsider subordinates” through the dynamic transformation of the roles. Using the process of game reasoning, the study identifies the differing principles used by insider subordinates and outsider subordinates in implementing deviant innovative behaviors. The simulation graph presents the perceived benefits of employees performing or not performing deviant innovative behaviors as clues during the (...) reasoning process, and implements deviant innovative behaviors for the high risk-taking trait of insider subordinates and the high internal control personality of outsider subordinates who implement deviant innovation. The theoretical derivation of behavior provides relevant references, and provides counter measures for effectively promoting employees’ deviant innovative behavior in the context of differential leadership. (shrink)

This work presents a proposal for the characterization of the UnconfinedCompressive Strength test, through a series of operations that can be carried outwithout inconvenience in the field. Initially, fresh rock samples are obtained from outcropsin the area and specimens of specific dimensions are made. After the test specimenelaboration phase, crushing and granulometric classification tests are carried out witha set of specimens and in parallel with a second group, UCS tests are carried out. With theresults, the rock is characterized by graphing (...) granulometric curves and in this graph theareas of fine granulometry are focused, inserting in these areas, the average value of UCS,with which it can be identified and determined when it is really necessary and It is inevitableto send rock samples to laboratories, thus saving time and money for the mining project. Keywords: compression, crushing, granulometry, rock. References [1] F. Blyth and M. de Freitas. Geología para Ingenieros. México: CEGSA, 2003. [2] F. Escolano and A. Mazariegos de la Serna. Guía de reconocimiento de rocas en Ingeniería Civil. España: Editorial Garceta, Escuela Técnica Superior de Ingeniería Civil, Universidad Politécnica de Madrid, 2014. [3] G. Stefano and J. Segovia. Notas del curso de Arte Minero I. Ecuador: Universidad del Azuay, 1991. [4] A. Maistri. Guía al Curso de Tratamiento de Minerales y a las Prácticas de Laboratorio. Ecuador: Universidad del Azuay, 1993. [5] O. Bustamante. Conminución de Minerales Trituración y Molienda. Colombia: Instituto de Minerales CIMEX, Universidad Nacional de Colombia-Sede Medellín, 2006. [6] E. Feijoo, C. Flores and B. Feijoo, "The Concept of the Granulometric Area and Its Relation with the Resistance to theSimple Compression of Rocks," 2019 7th International Engineering, Sciences and Technology Conference, Panama,Panama, 2019, pp. 52-56. [7] E. Feijoo and C. Iñiguez, “Corte en rocas y su relación con la resistencia a compresión simple”, RISTI, N.o E 30, pp. 59-67,junio 2020. [8] M. Galván. Mecánica de Rocas. Correlación entre la Resistencia a Carga Puntual y la Resistencia a Compresión Simple. Colombia: Universidad del Valle, 2015. [9] W. Marín. Evaluación de parámetros materiales de fractura en roca intacta. Colombia: Universidad Nacional de Colombiasede Medellín, 2017. [10]E. Feijoo and J. Padrón, “La resistividad de rocas y su relación con la resistencia a compresión simple en mina”, UCT, vol. 24, Núm. 99, pp. 61-67, abril 2020. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Reviewed by:The Rembrandt BookProfessor Emeritus John Adkins RichardsonThe Rembrandt Book by Gary Schwartz. New York: Harry N. Abrams, 2006, 384 pp. $40.95, cloth.This truly is the Rembrandt book. Substantial in every way, it is physically imposing, magnificently printed on heavy, glossy stock and profusely illustrated with splendid color reproductions of all the master’s major works and many sketches and preparatory drawings, as well as etchings and dry-point engravings. Gary (...) Schwartz, who studied art history at New York University and Johns Hopkins University, is now living in the Netherlands. The merits of his book are enormous. Not only is it filled with magnificent reproductions, there are tables and graphs detailing such things as the number of Rembrandt paintings in catalogues from 1836 to 1992; analyses of the artist’s borrowings and adaptations in five-year periods; key dates in the life of the man; Rembrandt’s relation to the forms of sale for paintings in the Dutch seventeenth century; and so on. There is even a computer rendering of the famous depiction of Captain Banning Cocq’s Company of Guards at the Gates of Amsterdam (popularly called The Night Watch), specifying the weapons shown and identifying all present, either by name and title or by a description, such as “girl in gold and blue,” “pikeman,” “musketeer,” etc.A sampling of the chapter headings and subcategories suggests just how comprehensive is Schwartz’s treatment: 1. Introduction, 2. A Dutch Artist’s Life, 3. Family, Loved Ones, Households, 4. Craft, 5. Earning and Spending, 6. Patrons, 7. Landscape, 8. Humankind, 9. Man and God. Just the specifics of the last chapter are remarkably capacious: Holy Family; Christ’s Ministry; Passion, Death and Afterlife; Divine Intervention; Holy People; Moral Examples from the Old Testament; The Man of God, Simeon; Afterlife; and Rembrandt as a Christian Rhetorician of the Brush. It’s hard to imagine a better reference for the lay reader than The Rembrandt Book.The book is also full of interesting contrasts of opinion as well as some surprising remarks. As for one of the latter, Schwartz writes that Rembrandt’s “portraits are said to be more ‘psychological’ than those of his contemporaries. What this might mean I frankly do not understand” (213). He goes on to note that the field of psychology did not exist in Rembrandt’s time. However, from long before its invention people spoke of Rembrandt’s ability to reveal the soul of the sitter. Indeed, the reason I was not surprised, although somewhat distressed, when the Rembrandt Research Project—a group of connoisseurs set up in 1969 with the explicit charge of authenticating all works ascribed to the master—announced in 1985 that The Man with a Golden Helmet in Berlin was not by the master at all, was that I had all along been troubled by this face that lacked the quality of animation in repose so [End Page 115] characteristic of Rembrandt portraits. Schwartz thinks the artist would have to have relied upon the ancient theory of the humors to do “characterological descriptions” of his sitters, and that in portraiture, “such characterizations would quickly resemble caricatures.” And, indeed, they do, but in profoundly subtle ways, much as someone like the popular illustrator Norman Rockwell employed tiny caricature-like distortions to project a kind of homely Americanism. I’m not comparing Rockwell to Rembrandt but choosing a realistic illustrator in whose work the trick is more apparent. Caricature can be as broad as it is in Jacques Callot, William Hogarth, or Honoré Daumier and yet be a feature of true art. Or so it seems to me, admittedly, a sometimes cartoonist as well as painter and engraver.Schwartz’s completeness of coverage leads him to include, in addition to superb drawings and prints, some that are so careless and hasty as to make one doubt their authenticity. One of the works of marginal quality is an etching of Six’s Bridge, which is said to have been created outdoors, hastily, on the site. This is a hotly debated issue. Rembrandt is known to have carried “varnished”—that is, grounded—copper etching plates, so there wouldn’t seem much reason to... (shrink)

We all intuitively know what a diagram is, and still it is surprisingly difficult to describe it as a semiotic function or type. In this article, we present four groups of hypotheses in view of a clarification. We hypothesize: (1) That diagrams are signs of a distinct type, unknown to classical semiotics; (2) That the elementary graphs of a diagram are all derived fromlines and pointsintopologicalmental spaces. The mind applies these diagrammatic spaces to referential spaces in many ways, but (...) basically through conceptual integration (blending). The mind blends topology and reference, which makes the topology unnoticeable; (3) That elementary diagrammatic graphs constitute a natural, phenomenological, spatiotemporal, figurative and dynamic but informal geometry in the embodied, thinking mind; (4) That diagrammatic signs are the active components of the abstract mental figuration in working memory that accompany perception and deliver the schematizing ideas which invest and connect our categories and construe proper descriptive, narrative, patterns of inferentialthoughtand programs of sensorimotor and social action. (shrink)

In our previous work we proved the conjecture NP = PSPACE by advanced proof theoretic methods that combined Hudelmaier’s cut-free sequent calculus for minimal logic with the horizontal compressing in the corresponding minimal Prawitz-style natural deduction. In this Addendum we show how to prove a weaker result NP = coNP without referring to HSC. The underlying idea is to omit full minimal logic and compress only “naive” normal tree-like ND refutations of the existence of Hamiltonian cycles in given non-Hamiltonian (...) class='Hi'>graphs, since the Hamiltonian graph problem in NPcomplete. Thus, loosely speaking, the proof of NP = coNP can be obtained by HSC-elimination from our proof of NP = PSPACE. (shrink)

Purpose This paper aims to describe the popular trends and methods and ICT tools used for mapping and visualization of scientific domains as a research methodology which is attracting more and more interest from scientific information and science studies professionals. Science mapping or bibliometric mapping is a spatial representation of how disciplines, fields, specialties and individual documents or authors. The researchers analysed Bibexel, Pajek, VOSViewer, programmes used for processing and visualization of bibliographic and bibliometric data, within the framework of the (...) implementation of IRNet research network project and activities and presented several examples of visualisation. Design/methodology/approach Among the main indicators of research effectiveness – bibliometric indicators – is a powerful information tool to support the development of science. Practical research methods were prepared using the programs: Bibexel, program Pajek: graph editing and visualization of the graph structure of co-authorship – using the method of Kamada-Kawai and VOSviewer: a computer program for creating maps based on network data and for visualizing and exploring these maps. The main features of VOSviewer can be summarized for creating maps based on network data, visualizing and exploring maps. Findings The cited references and keywords are used to analyse in particular the intellectual base used by the research field or to analyse documents that cite the same references. Originality/value The authors of the paper, who are researchers of the European IRNet project and international research network, described and analysed certain bibliographic results of these activities using methods of mapping and visualization of scientific domains. (shrink)

König, D. [1926. ‘Sur les correspondances multivoques des ensembles’, Fundamenta Mathematica, 8, 114–34] includes a result subsequently called König's Infinity Lemma. Konig, D. [1927. ‘Über eine Schlussweise aus dem Endlichen ins Unendliche’, Acta Litterarum ac Scientiarum, Szeged, 3, 121–30] includes a graph theoretic formulation: an infinite, locally finite and connected graph includes an infinite path. Contemporary applications of the infinity lemma in logic frequently refer to a consequence of the infinity lemma: an infinite, locally finite tree with a root has (...) a infinite branch. This tree lemma can be traced to [Beth, E. W. 1955. ‘Semantic entailment and formal derivability’, Mededelingen der Kon. Ned. Akad. v. Wet., new series 18, 13, 309–42]. It is argued that Beth independently discovered the tree lemma in the early 1950s and that it was later recognized among logicians that Beth's result was a consequence of the infinity lemma. The equivalence of these lemmas is an easy consequence of a well known result in graph theory: every connected, locally finite graph has among its partial subgraphs a spanning tree. (shrink)

We live in a fragmented environment where spatial information is scattered across rooms, streets, neighborhoods, and cities. To point out the direction to a currently non-visible location or to find novel shortcuts across previously untraveled terrain we need to rely on our spatial memory by piecing the experienced fragments together in our head. This thesis is concerned with the question of how our spatial memory for navigable space (also called survey knowledge) is structured. Two major theoretical approaches are contrasted. Euclidean (...) map approaches assume that spatial locations are represented in a map-like, globally embedded, Euclidean format. Enriched graph approaches propose a partitioned, unit-wise representation of places connected in a network. In four consecutive studies participants learned spatial relations between objects spread across virtual environments and solved survey tasks afterward (e.g., pointing to object locations from memory). The observed effects imply that our memory of navigable space is stored in the format of an Enriched graph, a network of local places connected by directed links, without the necessity of a global calibration. Survey estimates seem to be constructed incrementally along the memorized connectivity and are generally transient. Additionally, a general reference direction can be acquired, a main direction that is propagated across a sub-group of multiple local places (i.e., a region) or that can cover the entire environment. Taken together, our representation of navigable space seems to be best described as an impossible puzzle where the memorized pieces and connections do not necessarily match up on a global scale. (shrink)

Within the context of Twitter analytics, the notion of implicit entity linking has recently been introduced to refer to the identification of a named entity, which is central to the topic of the tw...

In this essay we introduce a new tool for studying the patterns of sentential reference within the framework introduced in [2] and known as the language of paradox $\mathcal {L}_{\mathsf {P}}$ : strong $\mathcal {L}_{\mathsf {P}}$ -homomorphisms. In particular, we show that (i) strong $\mathcal {L}_{\mathsf {P}}$ -homomorphisms between $\mathcal {L}_{\mathsf {P}}$ constructions preserve paradoxicality, (ii) many (but not all) earlier results regarding the paradoxicality of $\mathcal {L}_{\mathsf {P}}$ constructions can be recast as special cases of our central result (...) regarding strong $\mathcal {L}_{\mathsf {P}}$ -homomorphisms, and (iii) that we can use strong $\mathcal {L}_{\mathsf { P}}$ -homomorphisms to provide a simple demonstration of the paradoxical nature of a well-known paradox that has not received much attention in this context: the McGee paradox. In addition, along the way we will highlight how strong $\mathcal {L}_{\mathsf {P}}$ -homomorphisms highlight novel connections between the graph-theoretic analyses of paradoxes mobilized in the $\mathcal {L}_{\mathsf {P}}$ framework and the methods and tools of category theory. (shrink)

Legal Judgment Prediction (LJP) is an essential component of legal assistant systems, which aims to automatically predict judgment results from a given criminal fact description. As a vital subtask of LJP, researchers have paid little attention to the numerical LJP, i.e., the prediction of imprisonment and penalty. Existing methods ignore numerical information in the criminal facts, making their performances far from satisfactory. For instance, the amount of theft varies, as do the prison terms and penalties. The major challenge is how (...) the model can obtain the ability of numerical comparison and magnitude perception, e.g., 400 < 500 < 800, 500 is closer to 400 than to 800. To this end, we propose a judicial knowledge-enhanced magnitude-aware reasoning architecture, called NumLJP, for the numerical LJP task. Specifically, we first implement a contrastive learning-based judicial knowledge selector to distinguish confusing criminal cases efficiently. Unlike previous approaches that employ the law article as external knowledge, judicial knowledge is a quantitative guideline in real scenarios. It contains many numerals (called anchors) that can construct a reference frame. Then we design a masked numeral prediction task to help the model remember these anchors to acquire legal numerical commonsense from the selected judicial knowledge. We construct a scale-based numerical graph using the anchors and numerals in facts to perform magnitude-aware numerical reasoning. Finally, the representations of fact description, judicial knowledge, and numerals are fused to make decisions. We conduct extensive experiments on three real-world datasets and select several competitive baselines. The results demonstrate that the macro-F1 of NumLJP improves by at least 9.53% and 11.57% on the prediction of penalty and imprisonment, respectively. (shrink)

We deal with the ranking problem of the nodes in a directed graph. The bilateral relationships specified by a directed graph may reflect the outcomes of a sport competition, the mutual reference structure between websites, or a group preference structure over alternatives. We introduce a class of scoring methods for directed graphs, indexed by a single nonnegative parameter α. This parameter reflects the internal slackening of a node within an underlying iterative process. The class of so-called internal slackening (...) scoring methods, denoted by λα, consists of the limits of these processes. It is seen that λ0 extends the invariant scoring method, while λ∞ extends the fair bets scoring method. Method λ1 corresponds with the existing λ-scoring method of Borm et al. (Ann Oper Res 109(1):61–75, 2002) and can be seen as a compromise between λ0 and λ∞. In particular, an explicit proportionality relation between λα and λ1 is derived. Moreover, the internal slackening scoring methods are applied to the setting of social choice situations where they give rise to a class of social choice correspondences that refine both the Top cycle correspondence and the Uncovered set correspondence. (shrink)

It is customary to consider late Imperial historiography as a barren waste of meagre and inaccurate chronicles and incompetent rhetorical epitomes, all overshadowed by the giant figure of Ammianus Marcellinus, the greatest literary genius, as E. Stein has called him , between Tacitus and Dante. In fact, however, the fifth century A.D. produced at least one writer who was, in the words of Niebuhr, ‘second to no historian even of the best ages in talent, good faith and wisdom; elegant and (...) very pure in style, he justly acquired praise and glory both among contemporaries and succeeding ages’. Niebuhr was referring to Priscus of Panium in Thrace, but Priscus was a member of a school of historical writing which had been founded earlier in the fifth century by Olympiodorus, an historian of scarcely less merit than Priscus and author of what J. B. Bury called ‘a highly important work’. Since even Schmid-Stahlin are not able to refer to a single essay or mono-graph on Olympiodorus, it may not be amiss to assemble the facts which are known about him and to try to discover, so far as the scanty materials permit, what sort of man he was and what sort of work he produced. (shrink)

The performance of deep Neural Networks (NNs) in the text (ChatGPT) and image (DALL‐E2) domains has attracted worldwide attention. Convolutional NNs (CNNs), Large Language Models (LLMs), Denoising Diffusion Probabilistic Models (DDPMs)/Noise Conditional Score Networks (NCSNs), and Graph NNs (GNNs) have impacted computer vision, language editing and translation, automated conversation, image generation, and social network management. Proteins can be viewed as texts written with the alphabet of amino acids, as images, or as graphs of interacting residues. Each of these perspectives (...) suggests the use of tools from a different area of deep learning for protein structural biology. Here, I review how CNNs, LLMs, DDPMs/NCSNs, and GNNs have led to major advances in protein structure prediction, inverse folding, protein design, and small molecule design. This review is primarily intended as a deep learning primer for practicing experimental structural biologists. However, extensive references to the deep learning literature should also make it relevant to readers who have a background in machine learning, physics or statistics, and an interest in protein structural biology. (shrink)

According to Peirce, iconic interpretation is an associative inference on the basis of similarity. In that sense, nearly all Chinese characters are icons. The more obvious support for this claim comes from the pictorial nature of Chinese characters, which are either ‘pictographic’ or ‘indicative’. A better adjective for both is ‘ideographic’ because they share the same interpretive movement from ‘graphs’ to ‘ideas’ that are similar. There is another direction in which a graph can be turned into an icon. Apart (...) from the semantic connection to the referent, a graph is also related through convention to a particular sequence of sounds which constitute its pronunciation. This has resulted in characters that are ‘picto-phonetic’ in nature. (shrink)

In the last two decades, the World Wide Web has become the universal, and — for many users — main information source. Search engines can efficiently serve daily life information needs due to the enormous redundancy of relevant resources on the web. For educational — and even more so for scientific information needs, the web functions much less efficiently: Scientific publishing is built on a culture of unique reference publications, and moreover abounds with specialized structures, such as technical nomenclature, (...) notational conventions, references, tables, or graphs. Moreover, many of these structures are peculiar to specialized communities determined by nationality, research group membership, or adherence to a special school of thought. To keep the much-lamented “digital divide” from becoming a “cultural divide”, we have to make online material more accessible and adaptable to individual users. In this paper we attack this goal for the field of mathematics where knowledge is abstract, highly structured, and extraordinarily interlinked. Modern, content-based representation formats like OpenMath or content MathML allow us to capture, model, relate, and represent mathematical knowledge objects and thus make them context-aware and machine-adaptable to the respective user contexts. Building on previous work which can make mathematical notations adaptable we employ user modeling techniques to make them adaptive to relieve the reader of configuration tasks. We present a comprehensive framework for adaptive notation management and evaluate it on an implementation integrated in the e-learning platform panta rhei. (shrink)