Diffusion or War? Foucault as a Reader of Tarde

The objective of this chapter is to clarify the social theory underlying in Foucault’s genealogy of power/knowledge thanks to a comparison with Tarde’s microsociology. Nietzsche is often identified as the direct (and unique) predecessor of this genealogy, and the habitual criticisms are worried about the intricate relations between Foucault and Marx. These perspectives omit to point to another – and more direct – antecedent of Foucault`s microphysics: the microsociology of Gabriel Tarde. Bio-power technologies must be read as Tardian inventions that, by propagation, have reconfigured pre-existing social spaces, building modern societies. We will see how the Tardean source in Foucault’s genealogy sheds new clarity about the micro-socio-logic involved in it, enabling us to identify some of its aporiae and to imagine some solutions in this respect as well

Recovering Grammar Relationships for the Java Language Specification

Grammar convergence is a method that helps discovering relationships between different grammars of the same language or different language versions. The key element of the method is the operational, transformation-based representation of those relationships. Given input grammars for convergence, they are transformed until they are structurally equal. The transformations are composed from primitive operators; properties of these operators and the composed chains provide quantitative and qualitative insight into the relationships between the grammars at hand. We describe a refined method for grammar convergence, and we use it in a major study, where we recover the relationships between all the grammars that occur in the different versions of the Java Language Specification (JLS). The relationships are represented as grammar transformation chains that capture all accidental or intended differences between the JLS grammars. This method is mechanized and driven by nominal and structural differences between pairs of grammars that are subject to asymmetric, binary convergence steps. We present the underlying operator suite for grammar transformation in detail, and we illustrate the suite with many examples of transformations on the JLS grammars. We also describe the extraction effort, which was needed to make the JLS grammars amenable to automated processing. We include substantial metadata about the convergence process for the JLS so that the effort becomes reproducible and transparent

Generation of folk song melodies using Bayes transforms

The paper introduces the `Bayes transform', a mathematical procedure for putting data into a hierarchical representation. Applicable to any type of data, the procedure yields interesting results when applied to sequences. In this case, the representation obtained implicitly models the repetition hierarchy of the source. There are then natural applications to music. Derivation of Bayes transforms can be the means of determining the repetition hierarchy of note sequences (melodies) in an empirical and domain-general way. The paper investigates application of this approach to Folk Song, examining the results that can be obtained by treating such transforms as generative models

"All The Things We Could [Se]e by Now [Concerning Violence & Boko Haram], If Sigmund Freud's Wife was Your Mother": Psychoanalysis, Race, & International Political Theory

In response to the sonic media and ludicrosity of her time, Hortense J. Spillers' paradigmatic essay ""All the Things You Could Be by Now, If Sigmund Freud's Wife Was Your Mother": Psychoanalysis and Race," transfigures Charles Mingus' melodic, cryptic, and most puzzling record title into a workable theoretical cacophony. Closely written within the contexts and outside the confines of "some vaguely defined territory between well established republics," Spillers is able to open up the sarcophagus of meaning(s) within the Black occupation of the psychoanalytic discourse. Mingus' original assertion, "all the things you could be by now, if Sigmund Freud's wife was your mother," means absolutely nothing insofar as it means everything in the face of constructed openings and invitations into "extending the realm of possibility for what might be known." As such, this article asks a similar question relating to what might be known about the sensual convergence of media, violence, and representation ('all the things we could see by now') of international, political, and theoretical significance. If anything, Spillers and Mingus compel us toward locating some semblance of forgotten relationality between what appears to be abstract, distant, and unfamiliar. Given our contemporary era of violent post-colonial terror and desires for alternatives to the afterlife of slavery, this article endorses the free-floating investigation into the live survey of unprotected human flesh in the specific case of Boko Haram's explosion in modern media. Is it possible that such a study is able to uncover the motive behind the assembly of spectatorship? Through a Freudian reading of human nature into international political theory, this article indicates that narrative formation and transmission is an essential component to the development of both ethno-universalisms and global constructions of race and captivity

Applying Formal Methods to Networking: Theory, Techniques and Applications

Despite its great importance, modern network infrastructure is remarkable for the lack of rigor in its engineering. The Internet which began as a research experiment was never designed to handle the users and applications it hosts today. The lack of formalization of the Internet architecture meant limited abstractions and modularity, especially for the control and management planes, thus requiring for every new need a new protocol built from scratch. This led to an unwieldy ossified Internet architecture resistant to any attempts at formal verification, and an Internet culture where expediency and pragmatism are favored over formal correctness. Fortunately, recent work in the space of clean slate Internet design---especially, the software defined networking (SDN) paradigm---offers the Internet community another chance to develop the right kind of architecture and abstractions. This has also led to a great resurgence in interest of applying formal methods to specification, verification, and synthesis of networking protocols and applications. In this paper, we present a self-contained tutorial of the formidable amount of work that has been done in formal methods, and present a survey of its applications to networking.Comment: 30 pages, submitted to IEEE Communications Surveys and Tutorial

Learning Language from a Large (Unannotated) Corpus

A novel approach to the fully automated, unsupervised extraction of dependency grammars and associated syntax-to-semantic-relationship mappings from large text corpora is described. The suggested approach builds on the authors' prior work with the Link Grammar, RelEx and OpenCog systems, as well as on a number of prior papers and approaches from the statistical language learning literature. If successful, this approach would enable the mining of all the information needed to power a natural language comprehension and generation system, directly from a large, unannotated corpus.Comment: 29 pages, 5 figures, research proposa

Recovering grammar relationships for the Java language specification

Grammar convergence is a method that helps in discovering relationships between different grammars of the same language or different language versions. The key element of the method is the operational, transformation-based representation of those relationships. Given input grammars for convergence, they are transformed until they are structurally equal. The transformations are composed from primitive operators; properties of these operators and the composed chains provide quantitative and qualitative insight into the relationships between the grammars at hand. We describe a refined method for grammar convergence, and we use it in a major study, where we recover the relationships between all the grammars that occur in the different versions of the Java Language Specification (JLS). The relationships are represented as grammar transformation chains that capture all accidental or intended differences between the JLS grammars. This method is mechanized and driven by nominal and structural differences between pairs of grammars that are subject to asymmetric, binary convergence steps. We present the underlying operator suite for grammar transformation in detail, and we illustrate the suite with many examples of transformations on the JLS grammars. We also describe the extraction effort, which was needed to make the JLS grammars amenable to automated processing. We include substantial metadata about the convergence process for the JLS so that the effort becomes reproducible and transparent