dôNrm'-lä-püsl

There have been many iterations of the Joan of Arc story: “testimonies,” books, and films have attempted to capture the drama of one of history’s most famous gender warriors. But few, if any, have been undertaken by an author who met her subject matter with such recognition and insight, a fellow warrior, a rebel in kind. kari edwards, a transgender activist and key figure in the Bay Area experimental writing scene of the late 1990s and early 2000s, was provocative and prescient in her concern for the way that language inflects, inflicts, and regulates gender norms. Her persistent efforts to break linguistic binaries and barriers have given her texts an ongoing urgency after her untimely death in 2006. This book brings to life an important document discovered in the late poet’s archive at the Poetry Collection at the University of Buffalo. The several notebooks and partial typescript (as well as various plans and notes) of edwards’ unfinished dôNrm’-lä-püsl, uncovered by Tina Žigon, offer an intriguing glimpse of a major new direction in edwards’ work, one in which her avant-garde instincts are channeled through rigorous research on this medieval figure. In this retelling – better to say “remixing” – of Joan of Arc’s fateful trial and martyrdom, we find the major theme so richly laced throughout edwards’ oeuvre: the courageous (but also depressingly mundane) struggle against the stifling regulation of language, appearance, and norms. edwards’s Joan of Arc, even in its incomplete and abbreviated form (which Žigon calls a “possible version” of edwards’s manuscript), offers an exciting engagement with one of the medieval period’s most challenging and mysterious figures

dôNrm'-lä-püsl

There have been many iterations of the Joan of Arc story: “testimonies,” books, and films have attempted to capture the drama of one of history’s most famous gender warriors. But few, if any, have been undertaken by an author who met her subject matter with such recognition and insight, a fellow warrior, a rebel in kind. kari edwards, a transgender activist and key figure in the Bay Area experimental writing scene of the late 1990s and early 2000s, was provocative and prescient in her concern for the way that language inflects, inflicts, and regulates gender norms. Her persistent efforts to break linguistic binaries and barriers have given her texts an ongoing urgency after her untimely death in 2006. This book brings to life an important document discovered in the late poet’s archive at the Poetry Collection at the University of Buffalo. The several notebooks and partial typescript (as well as various plans and notes) of edwards’ unfinished dôNrm’-lä-püsl, uncovered by Tina Žigon, offer an intriguing glimpse of a major new direction in edwards’ work, one in which her avant-garde instincts are channeled through rigorous research on this medieval figure. In this retelling – better to say “remixing” – of Joan of Arc’s fateful trial and martyrdom, we find the major theme so richly laced throughout edwards’ oeuvre: the courageous (but also depressingly mundane) struggle against the stifling regulation of language, appearance, and norms. edwards’s Joan of Arc, even in its incomplete and abbreviated form (which Žigon calls a “possible version” of edwards’s manuscript), offers an exciting engagement with one of the medieval period’s most challenging and mysterious figures

Condition based maintenance of trains doors

As part of the project DUST financed by Vinnova, we have investigated whether event data generated on trains can be used for finding evidence of wear on train doors. We have compared the event data and maintenance reports relating to doors of Regina trains. Although some interesting relations were found, the overall result is that the information in event data about wear of doors is very limited

When are projections also embeddings?

We study an autonomous four-dimensional dynamical system used to model certain geophysical processes.This system generates a chaotic attractor that is strongly contracting, with four Lyapunov exponents $\lambda_i$ that satisfy $\lambda_1+ \lambda_2+\lambda_3<0$, so the Lyapunov dimension is $D_L=2+|\lambda_3|/\lambda_1 < 3$ in the range of coupling parameter values studied. As a result, it should be possible to find three-dimensional spaces in which the attractors can be embedded so that topological analyses can be carried out to determine which stretching and squeezing mechanisms generate chaotic behavior. We study mappings into $R^3$ to determine which can be used as embeddings to reconstruct the dynamics. We find dramatically different behavior in the two simplest mappings: projections from $R^4$ to $R^3$. In one case the one-parameter family of attractors studied remains topologically unchanged for all coupling parameter values. In the other case, during an intermediate range of parameter values the projection undergoes self-intersections, while the embedded attractors at the two ends of this range are topologically mirror images of each other

Interval Modulation Coding

In this paper we introduce a new paradigm for storage and communication. We call this paradigm Interval Modulation Coding. Both in the context of communication and storage, one needs to measure the elapsed time between voltage transitions or voltage pulses. Conventionally, this measurement is made by a clock, by counting clock pulses. Analog circuits (or clocks of higher frequency) can also be used to measure elapsed time. And in this case the set of permissible time intervals no longer has to consist of consecutive integer multiples of the clock period but can be chosen in accordance with a probabilistic model of measurement error. We will show that this can potentially provide substantial improvements in terms of bandwitdth and storage density over coding techniques deployed in real storage and communication systems. We provide a mechanism for encoding and decoding data based on variable length to variable length prefix free codes. We show that such codes can be constructed using integer linear programming. From a theoretical standpoint, we study the linear programming relaxation of the integer linear program associated with code construction. We provide an efficient algorithm for determining if the linear programming relaxation is feasible and an efficient algorithm for solving the linear programming relaxation, assuming it is feasible