An exercise in reclaiming electronic literary works on inaccessible platforms, examining four works as both artifacts and operations. Many pioneering works of electronic literature are now largely inaccessible because of changes in hardware, software, and platforms. The virtual disappearance of these works—created on floppy disks, in Apple's defunct HyperCard, and on other early systems and platforms—not only puts important electronic literary work out of reach but also signals the fragility of most works of culture in the digital age. In response, Dene Grigar and Stuart Moulthrop have been working to document and preserve electronic literature, work that has culminated in the Pathfinders project and its series of “Traversals”—video and audio recordings of demonstrations performed on historically appropriate platforms, with participation and commentary by the authors of the works. In Traversals, Moulthrop and Grigar mine this material to examine four influential early works: Judy Malloy's Uncle Roger (1986), John McDaid's Uncle Buddy's Phantom Funhouse (1993), Shelley Jackson's Patchwork Girl (1995) and Bill Bly's We Descend (1997), offering “deep readings” that consider the works as both literary artifacts and computational constructs. For each work, Moulthrop and Grigar explore the interplay between the text's material circumstances and the patterns of meaning it engages and creates, paying attention both to specificities of media and purposes of expression.

Working at the intersection of psychoanalytic, queer, and transgender theories, this book argues for the need to read Lacanian psychoanalysis through a queer and trans-positive framework. In so doing, it challenges the dimensions of fantasy at play in efforts to insist on the continued validity of the binary gender system. Targeting the Lacanian concept of “sexual difference” - that desire is structured through the difference between masculine and feminine - it argues that this idea is not transhistorical, as orthodox Lacanians claim, but rather a historically contingent fantasy. As such, it argues that psychoanalytic queer theorists need to go beyond this fantasy to register truly the full range of sexualities and modes of embodiment. Examining texts as diverse as films such as Hedwig and the Angry Inch and literary texts such as Paul takes the Form of a Mortal Girl, the book enables a queer and trans- inclusive model of theorizing subjectivity in psychoanalysis, psychosocial studies and cultural studies.

A friendly introduction to the most useful algorithms written in simple, intuitive English The revised and updated second edition of Essential Algorithms, offers an accessible introduction to computer algorithms. The book contains a description of important classical algorithms and explains when each is appropriate. The author shows how to analyze algorithms in order to understand their behavior and teaches techniques that the can be used to create new algorithms to meet future needs. The text includes useful algorithms such as: methods for manipulating common data structures, advanced data structures, network algorithms, and numerical algorithms. It also offers a variety of general problem-solving techniques. In addition to describing algorithms and approaches, the author offers details on how to analyze the performance of algorithms. The book is filled with exercises that can be used to explore ways to modify the algorithms in order to apply them to new situations. This updated edition of Essential Algorithms: Contains explanations of algorithms in simple terms, rather than complicated math Steps through powerful algorithms that can be used to solve difficult programming problems Helps prepare for programming job interviews that typically include algorithmic questions Offers methods can be applied to any programming language Includes exercises and solutions useful to both professionals and students Provides code examples updated and written in Python and C# Essential Algorithms has been updated and revised and offers professionals and students a hands-on guide to analyzing algorithms as well as the techniques and applications. The book also includes a collection of questions that may appear in a job interview. The book’s website will include reference implementations in Python and C# (which can be easily applied to Java and C++).

This book constitutes the refereed proceedings of the 17th International Conference on Conceptual Structures, ICCS 2009, which took place in Moscow, Russia, on July 26-31, 2009. The 18 papers presented together with 5 invited contributions were carefully reviewed and selected from approximately 50 submissions. Originally centered around research on knowledge representation and reasoning with conceptual graphs, over the years ICCS has broadened its scope to include innovations from a wider range of theories and related practices, among them other forms of graph-based formalisms like RDF or existential graphs, formal concept analysis, semantic Web technologies, ontologies, concept mapping and more.

For beginners to level up Core Programming Skills DESCRIPTION The book gives full understanding of theoretical topic and easy implementation in programming. The book is going to help students in self-learning of data structures and in understanding how these concepts are implemented in programs. It contains lot of figures, which will help students to visualize the concept effectively. Diagrams help students to understand how the programs involving data structure concepts are implemented within the computer system. Algorithms are included to clear the concept of data structure. Each algorithm is explained with figures to make student clearer about the concept. Sample data set is taken and step by step execution of algorithm is provided in the book to ensure the in Ð depth knowledge of students about the concept discussed. KEY FEATURES Simple and easy to understand. Useful for any level of students including B.E., BTech, MCA, BCA, B.Sc. (Computer Science), etc. Algorithms used in the book are well explained and illustrated step by step. Help students in understanding how data structures are implemented in programs. Each module contains question bank which includes questions for competitive examinations like UGC-NET, placement drives, and so on. WHAT WILL YOU LEARN New features and essential of Algorithms and Arrays. Linked List, its type and implementation. Stacks and Queues Trees and Graphs Searching and Sorting Greedy method Beauty of Blockchain WHO THIS BOOK IS FOR This book is useful for all the students of B. Tech, B.E., MCA, BCA, B.Sc. (Computer Science), and so on. Person with basic knowledge in this field can understand the concept from the beginning of the book itself. We think our book is one of a kind. We are trying to connect the past and the present here. The last module of our book is focussing on BLOCKCHAIN. It explains the concepts of blockchain through a different dimension, that is, explaining the data structure aspect of blockchain. Table of Contents 1. Algorithm and Arrays 2. Linked Lists 3. Stacks and queues 4. Trees and Graphs 5. Searching and Sorting 6. Greedy Method 7. Beauty of Blockchain

Containing exercises and materials that engage students at all levels, Discrete Mathematics with Ducks presents a gentle introduction for students who find the proofs and abstractions of mathematics challenging. This classroom-tested text uses discrete mathematics as the context for introducing proofwriting. Facilitating effective and active learni

The availability of cheaper, faster, and more reliable electronic components has stimulated important advances in computing and communication technologies. Theoretical and algorithmic approaches that address key issues in sensor networks, ad hoc wireless networks, and peer-to-peer networks play a central role in the development of emerging network