Strange Assemblage

This paper contends that the power of Deleuze & Guattari’s (1988) notion of assemblage as theorised in 1000 Plateaus can be normalised and reductive with reference to its application to any social-cultural context where an open system of dynamic and fluid elements are located. Rather than determining the assemblage in this way, this paper argues for an alternative conception of ‘strange assemblage’ that must be deliberately and consciously created through rigorous and focused intellectual, creative and philosophical work around what makes assemblages singular. The paper will proceed with examples of ‘strange assemblage’ taken from a film by Peter Greenaway (A Zed and 2 Noughts); the film ‘Performance’; educational research with Sudanese families in Australia; the book, Bomb Culture by Jeff Nuttall (1970); and the band Hawkwind. Fittingly, these elements are themselves chosen to demonstrate the concept of ‘strange assemblage’, and how it can be presented. How exactly the elements of a ‘strange assemblage’ come together and work in the world is unknown until they are specifically elaborated and created ‘in the moment’. Such spontaneous methodology reminds us of the 1960s ‘Happenings’, the Situationist International and Dada/Surrealism. The difference that will be opened up by this paper is that all elements of this ‘strange assemblage’ cohere in terms of a rendering of ‘the unacceptable.'

The Existential Passage Hypothesis

[Excerpt from “Section 1: Summary of the conclusions”] In Chapter 9, Stewart defends the thesis that if non-reductive physicalism is true, then, contrary to a widespread belief, death does not bring about eternal oblivion, a permanent cessation of the stream of consciousness at the moment of death. Stewart argues that the stream of consciousness continues after death—devoid of the body’s former memories and personality traits—and it does so as the stream of consciousness of new, freshly conscious bodies (other humans, animals, etc., that are conceived and develop consciousness). And so, any permanent cessation of the stream of consciousness at the moment of death is impossible as long as new, freshly conscious bodies come to exist. Consciousness is defined here as awareness, and is not limited to self-awareness (i.e., the recognition of one’s awareness). This general thesis does not specify when in the future those new, freshly conscious bodies must have come into being. This thesis has been independently defended by several authors

Almost-Smooth Histograms and Sliding-Window Graph Algorithms

We study algorithms for the sliding-window model, an important variant of the data-stream model, in which the goal is to compute some function of a fixed-length suffix of the stream. We extend the smooth-histogram framework of Braverman and Ostrovsky (FOCS 2007) to almost-smooth functions, which includes all subadditive functions. Specifically, we show that if a subadditive function can be $(1+\epsilon)$-approximated in the insertion-only streaming model, then it can be $(2+\epsilon)$-approximated also in the sliding-window model with space complexity larger by factor $O(\epsilon^{-1}\log w)$, where $w$ is the window size. We demonstrate how our framework yields new approximation algorithms with relatively little effort for a variety of problems that do not admit the smooth-histogram technique. For example, in the frequency-vector model, a symmetric norm is subadditive and thus we obtain a sliding-window $(2+\epsilon)$-approximation algorithm for it. Another example is for streaming matrices, where we derive a new sliding-window $(\sqrt{2}+\epsilon)$-approximation algorithm for Schatten $4$-norm. We then consider graph streams and show that many graph problems are subadditive, including maximum submodular matching, minimum vertex-cover, and maximum $k$-cover, thereby deriving sliding-window $O(1)$-approximation algorithms for them almost for free (using known insertion-only algorithms). Finally, we design for every $d\in (1,2]$ an artificial function, based on the maximum-matching size, whose almost-smoothness parameter is exactly $d$

A p-adic quasi-quadratic point counting algorithm

In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$ and space complexity $O(n^2)$, where $n=\log(q)$. In the latter complexity estimate the genus and the characteristic are assumed as fixed. Our algorithm forms a generalization of both, the AGM algorithm of J.-F. Mestre and the canonical lifting method of T. Satoh. We canonically lift a certain arithmetic invariant of the Jacobian of the hyperelliptic curve in terms of theta constants. The theta null values are computed with respect to a semi-canonical theta structure of level $2^\nu p$ where $\nu >0$ is an integer and p=\mathrm{char}(\F_q)>2. The results of this paper suggest a global positive answer to the question whether there exists a quasi-quadratic time algorithm for the computation of the number of rational points on a generic ordinary abelian variety defined over a finite field.Comment: 32 page

Low carbon energy and development in low-income countries: policy lessons from a study of the off-grid photovoltaics sector in Kenya

No description supplie