ppxscal/embedding_network huggingface dataset:
An analysis of using reflectors for distributed denial-of-service attacks
Authors: Vern Paxson
Venue: ACM SIGCOMM Computer Communication Review (2001)

Attackers can render distributed denial-of-service attacks more difficult to defend against by bouncing their flooding traffic off of reflectors; that is, by spoofing requests from the victim to a large set of Internet servers that will in turn send their combined replies to the victim. The resulting dilution of locality in the flooding stream complicates the victim's abilities both to isolate the attack traffic in order to block it, and to use traceback techniques for locating the source of streams of packets with spoofed source addresses, such as ITRACE [Be00a], probabilistic packet marking [SWKA00], [SP01], and SPIE [S+01]. We discuss a number of possible defenses against reflector attacks, finding that most prove impractical, and then assess the degree to which different forms of reflector traffic will have characteristic signatures that the victim can use to identify and filter out the attack traffic. Our analysis indicates that three types of reflectors pose particularly significant threats: DNS and Gnutella servers, and TCP-based servers (particularly Web servers) running on TCP implementations that suffer from predictable initial sequence numbers. We argue in conclusion in support of "reverse ITRACE" [Ba00] and for the utility of packet traceback techniques that work even for low volume flows, such as SPIE.
Physics-Based Deformable Models: Applications to Computer Vision, Graphics, and Medical Imaging, 1st edition
Authors: Dimitris N. Metaxas
Venue:  (1996)

:Physics-Based Deformable Models presents a systematic physics-based framework for modeling rigid, articulated, and deformable objects, their interactions with the physical world, and the estimation of their shape and motion from visual data. This book presents a large variety of methods and associated experiments in computer vision, graphics and medical imaging that help the reader better understand the presented material. In addition, special emphasis has been given to the development of techniques with interactive or close to real-time performance. Physics-Based Deformable Models is suitable as a secondary text for a graduate level course on Computer Graphics, Computational Physics, Computer Vision, Medical Imaging, or Biomedical Engineering. In addition, this book is appropriate as a reference for researchers and practitioners in the above mentioned fields.
I Hate PCs: A Friendly Guide for the Frustrated User
Authors: Brian Pfaffenberger
Venue:  (1993)

:This innovative approach offers beginners the information they need with tips to help them use and cope with their PCs!Features numerous cartoons from nationally recognized cartoonist Jeff MacNelly that accent information in a lighthearted mannerSpecial features include extensive indexing and larger type to make text easy to understand, reminders, troubleshooting maps, "In a Nutshell" chapter previews, "Quick & Dirty Dozens" that close each chapter with 12 tips, and more The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Crossing Lines: Research and Policy Networks for Developing Country Education
Authors: Noel F. McGinn
Venue:  (1996)

:Crossing Lines analyzes the experiences of more than 25 education research networks spanning Africa, Latin America, Asia, and Europe. Their history yields rich insights into the construction and maintenance of communication structures and processes that increase the utility, and the utilization, of education policy research. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Visual Basic 4 CD Tutor with CD-ROM Interactive Multimedia Seminar in a Box
Authors: Clint Hicks
Venue:  (1996)

:The easiest way to learn the latest version of Visual Basics is to have an expert show you how to get started. That's what Visual Basic 4 Tutor is all about. This unique package includes a CD-ROM with 19 interactive lessons and hundreds of voice and video segments which take you step by step through the application development process! You learn by seeing and doing! It's everything you need to start developing your own Visual Basic applications - all in one package! Each lesson includes step-by-step multimedia clips, voice-over narration, and detailed notes in the workbook; lesson quizzes test your skills and adjust to strengthen your weak spots; and special multimedia reference allows you to click on the Visual Basic interface to learn more about it.
Balancing methods for binary search trees
Authors: James Michael Cannady
Venue: Proceedings of the 16th annual Southeast regional conference (1978)

Binary search trees have received a great deal of attention in recent years. As a result of this interest, several methods have been developed for balancing them; namely, random, height-balanced, bounded-balance, and weight-balanced trees. These methods which include weighted and non-weighted binary search trees are grouped into two classes: 1) dynamic balancing and 2) total restructuring. The rational and properties of the more significant methods are discussed and compared with other tree balancing algorithms. These comparisons provide insight about the conditions under which an algorithm is appropriate.
Functorial models for petri nets
Authors: Roberto Bruni, José Meseguer, Ugo Montanari, Vladimiro Sassone
Venue: Information and Computation (2001)

We show that although the algebraic semantics of place/transition Petri nets under the collective token philosophy can be fully explained in terms of strictly symmetric monoidal categories, the analogous construction under the individual token philosophy is not completely satisfactory, because it lacks universality and also functoriality. We introduce the notion of pre-nets to overcome this, obtaining a fully satisfactory categorical treatment, where the operational semantics of nets yields an adjunction. This allows us to present a uniform logical description of net behaviors under both the collective and the individual token philosophies in terms of theories and theory morphisms in partial membership equational logic. Moreover, since the universal property of adjunctions guarantees that colimit constructions on nets are preserved in our algebraic models, the resulting semantic framework has good compositional properties. Copyright 2001 Academic Press.
Scientific Pascal, 2nd edition
Authors: Harley Flanders
Venue:  (1995)

:This book is a self-contained text on the Pascal programming language that will be of great interest to science and technology students, scientists, and engineers, who will appreciate the clarity and facility of Pascal. Its emphasis on scientific problems is unique. Every aspect of Pascal programming is illustrated and applied (including graphics, DOS, BIOS, and mouse programming) through hundreds of worked examples and exercises culled from the numerical analysis and algorithm literature. All of the book's programs have been tested, and they are listed in a clear, uncluttered format. The book includes a diskette with all of the program code printed in the text, answers to exercises, additional programs, and useful data files. The programs are written for the Borland Pascal compiler on the MS-DOS platform.
OSF/Motif Programmer's Reference Release 1.2
Authors: CORPORATE Open Software Foundation Staff
Venue:  (1992)

:A complete reference manual that details all Motif commands and functions including, the toolkit, window manager and user interface language. The separate alphabetical listing of each command and function is a practical reference for programmers writing applications using the Motif interfaces. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Discover Visual J++ with CD, 1st edition
Authors: Paul J. Perry
Venue:  (1997)

:What Microsoft brought to C++ with its Visual C++ development tool it now brings to Java with Visual J++. Discover Visual J++ shows you how to use this powerful new tool to create applets that transform static Web pages into interactive, functional, multimedia-rich Web pages. Even if you've never programmed before, thanks to expert guidance from author Paul J. Perry you'll soon discover how to Take advantage of AppletWizard to create Java applets in minutes Enliven Web pages with real-time audio, animation, and other special effects Write Java applets that run on any computer platform Analyze Java code with the invaluable Java J++ Development Kit Integrate graphics and user interface elements for truly interactive Web pages Benefit from the latest enhancements to HTML Use ActiveX support to share prebuilt objects locally or over a network Plus, Discover Visual J++ comes complete with a bonus CD-ROM containing all the source code presented in the book. Experiment with it or adapt it for your own use. As all of the titles in our Discover series, Discover Visual J++ features the 6-Point Advantage Color Tear-Out Card -- Key information and shortcuts that get you up to speed fast Discovery Center -- Quick summaries of the chapters' major points collected at the back of the book Real-Life Vignettes -- Winning stories on how real people use technology to improve their lives Visual Index -- Convenient picture maps direct you to the features you're looking for Web Path -- Handy references to feature- or topic-relatedWeb sites Bonus Section -- Added-value tips and timesaving techniques at the end of each chapter
Ordinal association rules for error identification in data sets
Authors: Andrian Marcus, Jonathan I. Maletic, King-Ip Lin
Venue: Proceedings of the tenth international conference on Information and knowledge management (2001)

A new extension of the Boolean association rules, ordinal association rules, that incorporates ordinal relationships among data items, is introduced. One use for ordinal rules is to identify possible errors in data. A method that finds these rules and identifies potential errors in data is proposed.
Microsoft Works for Windows 95 for Dummies, 1st edition
Authors: David C. Kay
Venue:  (1995)

:You know Microsoft Works for Windows 95 is easy to use, but you probably think it takes some other, more expensive application to do anything sophisticated. Microsoft Works For Windows 95 For Dummies proves that this popular integrated software really can do fancy things like managing multiple mailing lists, with customized letters; answer complex what-if financial questions; and even publish professional, impressive reports containing text right along with database and spreadsheet data and illustrations you create with the built-in paint program. Plus, author David C. Kay to show you the way, you'll be able to send and receive documents via modem -- without ever having to leave Microsoft Works.
Learn Pascal in Three Days, 2nd edition
Authors: Sam A. Abolrous
Venue:  (1997)

:This second edition covers the standard UCSD Pascal programming language. The sample programs included in the book can be used with any popular Pascal compiler, and this revised edition provides an expanded selection of samples and chapter drills including answers ideally suited for self study for beginners. Programs and examples are found on the companion disk. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
MicroSim PSpice for Windows: A Curcuit Simulation Primer, 2nd edition
Authors: Roy W. Goody
Venue:  (1997)

:Written for novices as well as experience readers, this circuit simulation book addresses PSpice for Windows! Using a step-by-step process, this book and software package takes readers from a simple dc circuit to a complex analog/digital circuit. Readers draw circuits exactly as they would to create initial designs, then analyze them using PSpice. The book is based on MicroSim DesignLab PSpice circuit simulator version 7.1, the latest version of the most popular simulation software available. It covers a wide range of electronic theory as well the major PSpice techniques and processes. Readers begin with simple circuits and detailed instructions and progress to complex and challenging assignments in the chapters covering PSpice techniques. The second edition of MicroSim PSpice for Windows Volume 1 has been revised to reflect an upgrade to PSpice Version 7.1. All diagrams and figures have been improved and make the book easier to follow. It now includes three new chapters: Chapter 4. Complex NumbersQThe AC Sweep Mode; Chapter 8. Device ModelsQTemperature Coefficient; and Chapter 32. OptimizationQGoals, Parameters, and Constraints. A valuable reference book for any design professional using PSpice. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Mining generalised disjunctive association rules
Authors: Amit A. Nanavati, Krishna P. Chitrapura, Sachindra Joshi, Raghu Krishnapuram
Venue: Proceedings of the tenth international conference on Information and knowledge management (2001)

This paper introduces generalised disjunctive association rules such as "People who buy bread also buy butter jam", and "People who buy either raincoats or umbrellas also buy flashlights". A generalised disjunctive association rule allows the disjunction of conjuncts, "People who buy jackets also buy bow ties or neckties and tiepins". Such rules capture contextual inter-relationships among items.Given a context (antecedent), there may be a large number of generalised disjunctive association rules that satisfy the minsupp and minconf constraints. It is computationally expensive to find all such rules. We present algorithm thrifty traverse which borrows concepts such as subsumption from propositional logic to mine a subset of such rules in a computationally feasible way. We experimented with our algorithm on US census data as well as transaction data from a grocery superstore to demonstrate its computational feasibility, utility and scalability.
Que's Guide to Lotus Notes
Authors: Mark Schulman
Venue:  (1993)

:This book introduces Lotus Notes to users who need to create access-shared information quickly!Provides insights that enable readers to be more effective collecting, organizing, and sharing over networksShows Lotus Notes users how to communicate better and improve teamworkIncludes expert tips and cautions
Carrara 1.0 Bible with Cdrom
Authors: Doug Sahlin
Venue:  (2000)

:Carrara is a full-featured 3D program, incorporating the best features from Infini-D and Ray Dream Studio, that doesn't intimidate new users. Carrara's predecessor, Ray Dream Studio, was a complicated program that requires a bit of hand-holding for those who want to explore its in depth features, and those unfamiliar with 3D software will be floundering, if left to their own devices. Carrara Bible would be the definitive, keystone book for both those who want help with its upper-end features, and beginners who are just getting their feet wet with the program. Learn how to use Scene Wizard, Object Wizard, and other guided features. Discover how to create 3D objects from scratch, and link them to others for logical movement patterns. Create organic models with Carrara's mesh form and metaball modelers. Develop realistic landscapes and atmospheres with Carrara. Discover how to use Carrara's built-in filters to add sophisticated photographic effects to rendered images and animations. Create animations from scratch complete with dazzling lighting and special effects. Practical examples show you how to use 3D paint right on your objects. Work like a pro to apply Texture Maps and Bump maps to 3D models. Discover how to use shaders, multiple cameras, story-driven animation and lighting to add realistic 3D images and animations. Learn to use the collision detection feature, which saves hours when creating moving objects, and special effects like fire, fountains, and explosions. The CD-ROM includes plug-ins, templates, freebies, demo products, tutorial results, and full color work related to the book. About The Author:Doug Sahlin (Lakeland, FL) has written product reviews and tutorials on 3D software that have appeared in Corel Magazine, 3D Design Magazine, Computer Graphics World as well as numerous Internet Web-zines. Doug has used Ray Dream Studio Bryce, Painter, CorelDRAW and Corel Photo Paint to create images and animations that have been incorporated in Web sites he has designed. His digital images have been featured at many Internet Art Galleries.
Facial animation framework for the web and mobile platforms
Authors: Igor S. Pandzic
Venue: Proceedings of the seventh international conference on 3D Web technology (2002)

Talking virtual characters are graphical simulations of real or imaginary persons capable of human-like behavior, most importantly talking and gesturing. They may find applications on the Internet and mobile platforms as newscasters, customer service representatives, sales representatives, guides etc. After briefly discussing the possible applications and the technical requirements for bringing such applications to life, we describe our approach to enable these applications: the Facial Animation Framework. This framework consists of (1) a lightweitht, portable, MPEG-4 compatible Facial Animation Player, (2) a system for fast production of ready-to-animate, MPEG-4 compatible face models and (3) a plethora of MPEG-4 compatible tools for Facial Animation content production. We believe that this kind of approach offers enough flexibility to rapidly adapt to a broad range of applications involving facial animation on various platforms.
Cellular automata transforms: theory and applications in multimedia compression, encryption, and modeling
Venue:  (2001)

Cellular automata transforms is divided in to two parts. In part I the fundamentals of cellular automata, including the history and traditional applications are outlined. The challenges faced in using CA to solve practical problems are described. Part II contains a description of applications of CAT.
Simulator sickness and presence in a high field-of-view virtual environment
Authors: A. Fleming Seay, David M. Krum, Larry Hodges, William Ribarsky
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

This paper describes a study that investigated the effect of field-of-view, display type, and user role on the experience of simulator sickness and presence in users of a virtual environment. Though it interacted with the other experimental factors, field-of-view was found to be the major determinant of both simulator sickness and presence.
Data reorganization engines for the next generation of system-on-a-chip FPGAs
Authors: Pedro C. Diniz, Joonseok Park
Venue: Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays (2002)

Field-Programmable-Core-Arrays (FPCA) will include various computing cores for a wide variety of applications ranging from DSP to general purpose computing. With the increasing gap between core computing speeds and memory access latency, managing and orchestrating the movement of data across multiple cores will become increasingly important. In this paper we propose data reorganization engines that allow a wide variety of data reorganizations intra- as well as inter-memory modules for future FPCAs. We have experimented with a suite of data reorganizations pervasive in DSP applications. Our limited set of experiments reveals that the proposed designs for these engines are flexile and use little design area in current FPGA fabrics, making them amenable to be easily integrated in future FPCAs as either soft- or hard- macros.
Constant-Time Addition and Simultaneous Format Conversion Based on Redundant Binary Representations
Authors: Dhananjeuy S. Phatak, Tom Goff, Israe Koren
Venue: IEEE Transactions on Computers (2001)

It is well-known that constant-time addition, in which the execution delay is independent of operand lengths, is feasible only if the output is expressed in a redundant representation. There are many ways of introducing redundancy and the specifics of the redundant format employed can have a major impact on the performance of constant-time addition and digit set conversion. This paper presents a comprehensive analysis of constant-time addition and simultaneous format conversion. We consider full as well as partially redundant representations, where not all digit positions are redundant. The number of redundant digits and their positions can be arbitrary, yielding many possible redundant representations. Format conversion refers to changing the number and/or position of redundant digits in a representation. It is shown that such a format conversion is feasible during (i.e., simultaneous with) constant time addition, even if all three operands (the two inputs and single output) are represented in distinct redundant formats. We exploit ¿equal-weight grouping¿ (EWG), wherein bits having the same weight are grouped together to achieve the constant-time addition and possible simultaneous format conversion. The analysis and data show that EWG leads to efficient implementations. We compare VLSI implementations of various constant-time addition cells and demonstrate that the conventional 4:2 compressor is the most efficient way to execute constant time-addition. We show interesting connections to prior results and indicate possible directions for further extensions.
A simple implementation technique for priority search queues
Authors: Ralf Hinze
Venue: Proceedings of the sixth ACM SIGPLAN international conference on Functional programming (2001)

This paper presents a new implementation technique for priority search queues. This abstract data type is an amazing blend of finite maps and priority queues. Our implementation supports logarithmic access to a binding with a given key and constant access to a binding with the minimum value. Priority search queues can be used, for instance, to give a simple, purely functional implementation of Dijkstra's single-source shortest-paths algorithm. A non-technical concern of the paper is to foster abstract data types and views. Priority search queues have been largely ignored by the functional programming community and we believe that they deserve to be known better. Views prove their worth both in defining a convenient interface to the abstract data type and in providing a readable implementation.