Transgressive bodies in the work of Julie Doucet, Fabrice Neaud and Jean-Christophe Menu: towards a theory of the 'autobioBD'

As the comic book, and more precisely its exceptionally francophone doppelganger, la bande dessinée, begins to fulfil its potential as 'the Ninth Art', the range of styles, reading contexts, and genres which constitute the form as a signifying practice has consequently expanded. Consideration of 'what a comic is', such as is found in the works of Thierry Groensteen and Benoît Peeters1 needs therefore to be complemented by a range of subsidiary questions addressing not only 'what kinds of comics there are', but, as an integral part of those inquiries, how different comic genres signify, and how the enunciative and representational functions deployed by each might be conceptualised. This paper considers the work of three Francophone comic artists, Fabrice Neaud and Jean-Christophe Menu, both French, and the Québecoise Julie Doucet, all of whom could be considered as proponents of the genre of BD we will call 'autobiocomics'. It will be argued that Neaud and Doucet, through their exploration of ontologies of presence and self-representation, work against the visual order of the phallocentric and heteronormative, an order which Menu appears to replicate but ultimately calls into question

Generalising feature interactions in email

We report on a property-based approach to feature interaction analysis for a client-server email system. The model is based upon Hall's email model presented at FIW'00, but the implementation is at a lower level of abstraction, employing non-determinism and asynchronous communication; it is a challenge to avoid deadlock and race conditions. The analysis is more extensive in two ways: interaction analysis is fully automated, based on model-checking the entire state-space, and results are scalable, that is they generalise to email systems consisting of any number of email clients. Abstraction techniques are used to prove general results. The key idea is to model-check a system consisting of a constant number (m) of client processes, in parallel with a mailer process and an ``abstract'' process which represents the product of any number of other (unfeatured, isomorphic) client processes. We give a lower bound for the value of m. All of the models -- for any specified set of client processes and selected features -- are generated automatically using Perl scripts

An automatic abstraction technique for verifying featured, parameterised systems

A general technique combining model checking and abstraction is presented that allows property based analysis systems consisting of an <i>arbitrary</i> number of featured components. We show how parameterised systems can be specified in a <i>guarded command</i> form with constraints placed on the variables which occur in guards. We prove that the results that hold for a small number of components can be shown to scale up. We then show how featured systems can be specified in a similar way, by relaxing the constraints on the guards. The main result is a generalisation theorem for featured systems which we apply to two well known examples

A generic approach for the automatic verification of featured, parameterised systems

A general technique is presented that allows property based feature analysis of systems consisting of an arbitrary number of components. Each component may have an arbitrary set of safe features. The components are defined in a guarded command form and the technique combines model checking and abstraction. Features must fulfill certain criteria in order to be safe, the criteria express constraints on the variables which occur in feature guards. The main result is a generalisation theorem which we apply to a well known example: the ubiquitous, featured telephone system

Using SPIN to Analyse the Tree Identification Phase of the IEEE 1394 High-Performance Serial Bus(FireWire)Protocol

We describe how the tree identification phase of the IEEE 1394 high-performance serial bus (FireWire) protocol is modelled in Promela and verified using SPIN. The verification of arbitrary system configurations is discussed

Automatic verification of any number of concurrent, communicating processes

The automatic verification of concurrent systems by model-checking is limited due to the inability to generalise results to systems consisting of any number of processes. We use abstraction to prove general results, by model-checking, about feature interaction analysis of a telecommunications service involving any number of processes. The key idea is to model-check a system of constant number (m) of concurrent processes, in parallel with an "abstract" process which represents the product of any number of other processes. The system, for any specified set of selected features, is generated automatically using Perl scripts

NASTRAN analysis of Tokamak vacuum vessel using interactive graphics

Isoparametric quadrilateral and triangular elements were used to represent the vacuum vessel shell structure. For toroidally symmetric loadings, MPCs were employed across model boundaries and rigid format 24 was invoked. Nonsymmetric loadings required the use of the cyclic symmetry analysis available with rigid format 49. NASTRAN served as an important analysis tool in the Tokamak design effort by providing a reliable means for assessing structural integrity. Interactive graphics were employed in the finite element model generation and in the post-processing of results. It was felt that model generation and checkout with interactive graphics reduced the modelling effort and debugging man-hours significantly

A template-based approach for the generation of abstractable and reducible models of featured networks

We investigate the relationship between symmetry reduction and inductive reasoning when applied to model checking networks of featured components. Popular reduction techniques for combatting state space explosion in model checking, like abstraction and symmetry reduction, can only be applied effectively when the natural symmetry of a system is not destroyed during specification. We introduce a property which ensures this is preserved, open symmetry. We describe a template-based approach for the construction of open symmetric Promela specifications of featured systems. For certain systems (safely featured parameterised systems) our generated specifications are suitable for conversion to abstract specifications representing any size of network. This enables feature interaction analysis to be carried out, via model checking and induction, for systems of any number of featured components. In addition, we show how, for any balanced network of components, by using a graphical representation of the features and the process communication structure, a group of permutations of the underlying state space of the generated specification can be determined easily. Due to the open symmetry of our Promela specifications, this group of permutations can be used directly for symmetry reduced model checking. The main contributions of this paper are an automatic method for developing open symmetric specifications which can be used for generic feature interaction analysis, and the novel application of symmetry detection and reduction in the context of model checking featured networks. We apply our techniques to a well known example of a featured network – an email system

A sensitive image intensifier which uses inert gas

High gain optical image intensifier utilizes inert gas cavity with copper electrodes to form electron avalanches without excessive pulse voltages. Estimated optical gain for device is two times 10 to the power of seven