ppxscal/embedding_network huggingface dataset:
The Lagging Anchor Algorithm: Reinforcement Learning in Two-Player Zero-Sum Games with Imperfect Information
Authors: Fredrik A. Dahl
Venue: Machine Learning (2002)

The article describes a gradient search based reinforcement learning algorithm for two-player zero-sum games with imperfect information. Simple gradient search may result in oscillation around solution points, a problem similar to the &ldquo;Crawford puzzle&rdquo;. To dampen oscillations, the algorithm uses lagging anchors, drawing the strategy state of the players toward a weighted average of earlier strategy states. The algorithm is applicable to games represented in extensive form. We develop methods for sampling the parameter gradient of a player's performance against an opponent, using temporal-difference learning. The algorithm is used successfully for a simplified poker game with infinite sets of pure strategies, and for the air combat game Campaign, using neural nets. We prove exponential convergence of the algorithm for a subset of matrix games.
Visual J++ 6 Secrets with Cdrom, 1st edition
Authors: Chuck A. Wood, Prendergast
Venue:  (1998)

:Chuck Wood brings you complete coverage of this new breed of Java authoring software, including database access, networking issues, Dynamic HTML options, and the questions of WFC vs. standard Java.
Bridging Work Practice and System Design: Integrating Systemic Analysis, Appreciative Intervention and Practitioner Participation
Venue: Computer Supported Cooperative Work (2001)

This article discusses the integration of work practice and system design. By scrutinising the unfolding discourse of workshop participants the co-construction of work practice issues as relevant design considerations is described. Through a mutual exploration of ethnography and participatory design the contributing constituents to the co-construction process are identified and put forward as elements in the integration of `systemic analysis' and `appreciative intervention'. The systemic analysis proposes collaboratively grounding the emergent understandings on an inductive and iterative analysis of actual technologically mediated work practice. The appreciative intervention, in turn, calls for envisioning images of future system and context through a recognition of presence and change intertwined in the existing ways of working. The identified elements are joined into three dimensions of interplay, namely the analytic distance, the horizon of work practice transformations and the situated generalisations, which reformulate new conceptualisations of what the integration of work practice and participatory system design is all about. It is suggested that these dimensions together with practitioner participation call into question some of the taken-for-granted assumptions and commonly forwarded intractable disciplinary dichotomies and contribute more generally to bridging work practice and participatory design.
Official Adobe Photoshop 5.0 Studio Techniques, 1st edition
Authors: Ben Willmore
Venue:  (1998)

:Official Adobe Photoshop 5 Studio Techniques teaches in full color and in a clear, well-organized style that intuitively follows the user through techniques rather than touring the application. The author teaches through the use of analogies and concepts, using a fun and informal--yet authoritative--tone. The book is divided into three sections: Part I: An introduction into the mechanics of the application. Covers the tools and palettes, and explains techniques such as selections and layers in language everyone can understand. Part II: Explores techniques. Rather than listing tools one by one, it demonstrates vital operations, covering each tool as it comes into play. Covers such topics as resolution, line art scanning, and working with grayscale images. Part III: Takes the reader through more advanced techniques. Covers topics such as color correction, composting, retouching, and other enhancements. Contains expert Adobe Photoshop techniques, fully compatible with Photoshop 5.0 and all its new capabilities Written by an experienced instructor who teaches Photoshop seminars at events and corporations nationwide Full four-color throughout the entire book!
Practical Data Analysis Volume II, 2nd edition
Authors: Peter G. Bryant, Marlene A. Smith
Venue:  (1998)

:Practical Data Analysis: Case Studies in Business Statistics is a collection of 75 class tested case studies for use in introductory business statistics and general statistics. All cases are drawn from real situations in a broad range of business,economic,and social science settings and include small and large data sets for analysis by students. The philosophy behind the package is to let the cases and data drive or supplement the course. Doing so provides three important opportunities for students and instructors: useful computing experience,hands-on activity,which is more motivating than the traditional course format,and a sense of realism about the use of statistics.
Exchange Server 5.5 Study Guide: Exam 70-081, 2nd edition
Authors: Richard L. Easlick, James Chellis
Venue:  (1998)

:Here's the book you need to prepare for Exam 70-081, Implementing and Supporting Microsoft Exchange Server 5.5. This Microsoft Certified Professional Approved Study Guide provides, full coverage of every exam objective - all the information you need to know, hundreds of challenging review questions, in the book and on the CD, and practical information on deploying Exchange Server and clients in real-world situations.
The Complete Linux Kit with Cdrom
Authors: Daniel A. Tauber, Brenda Kienan
Venue:  (1995)

:Find out why PC Week recently named Linux its Product of the Week. Linux is a full-blown Unix-compatible operating system. This book/CD pack includes the best commercial distribution of Linux available on disk, along with plenty of insight into packing your PC with the power of UNIX. Explore the product's windowing system, software development tools, typesetting package, and TCP/IP networking. The book also includes an exclusive installation and troubleshooting section that virtually eliminates setup headaches.
Data flow analysis of communicating processes
Authors: John H. Reif
Venue: Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1979)

Data flow analysis is a technique essential to the compile-time optimization of computer programs, wherein facts relevant to program optimizations are discovered by the global propagation of facts obvious locally.This paper extends flow analysis techniques developed for sequential programs to the analysis of communicating, concurrent processes.
Robotics Technology
Authors: James W. Masterson, Stephen W. Fardo, Robert L. Towers
Venue:  (2001)

:This text employs a comprehensive approach to presenting the technical aspects of robotics. Robotics Technology covers the basic principles of industrial robotics, power supplies and movement systems, sensing and end-of-arm tooling, and control systems. The text format is easy-to-follow and highly illustrated, making this an outstanding choice for introductory level robotics courses and robotics technician training.
Practical Approximation Algorithms for Zero- and Bounded-Skew Trees
Authors: Alexander Z. Zelikovsky, Ion I. Mandoiu
Venue: SIAM Journal on Discrete Mathematics (2002)

The skew of an edge-weighted rooted tree is the maximum difference between any two root-to-leaf path weights. Zero- or bounded-skew trees are needed for achieving synchronization in many applications, including network multicasting [G. N. Rouskas and I. Baldine, IEEE J. on Selected Areas in Communication, 15 (1997), pp. 346--356] and VLSI clock routing [H. Bakoglu, Circuits, Interconnections, and Packaging for VSLI, Addison-Wesley, Reading, MA, 1990, A. B. Kahng and G. Robins, On Optimal Interconnections for VSLI, Kluwer Academic Publishers, Norwell, MA, 1995]. In these applications edge weights represent propagation delays, and a signal generated at the root should be received by multiple recipients located at the leaves (almost) simultaneously. The objective is to find zero- or bounded-skew trees of minimum total weight, since the weight of the tree is directly proportional to the amount of resources (bandwidth and buffers for network multicasting, power and chip area for clock routing in VLSI) that must be allocated to the tree. Charikar et al. in [Proceedings of the Tenth ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 1999, ACM, New York, 1999, pp. 177--184] have recently proposed the first strongly polynomial algorithms with proven constant approximation factors, $2e\approx 5.44 and 16.86, for finding minimum weight zero- and bounded-skew trees, respectively.In this paper we introduce a new approach to these problems, based on zero-skew "stretching" of spanning trees, and obtain algorithms with improved approximation factors of 4 and 14. For the case when tree nodes are points in the plane and edge weights are given by the rectilinear metric our algorithms find zero- and bounded-skew trees of length at most 3 and 9 times the optimum. This case is of special interest in VLSI clock routing. An important feature of our algorithms is their practical running time, which is asymptotically the same as the time needed for computing the minimum spanning tree.
Practical computer graphics for scientific users
Authors: Thomas J. Wright
Venue: Proceedings of the 1st annual conference on Computer graphics and interactive techniques (1974)

The scientific computer user presents a unique challenge to the graphics system designer. If the graphics system is properly designed and implemented, computer graphics becomes a vital research tool for the scientific user. These users' desires and expectations play an important role in every phase of the design process.This paper describes the philosophy of the graphics system at the National Center for Atmospheric Research (NCAR) and its implementation. Details of algorithms are not presented; rather the purpose has been to describe a successful computer graphics system which may serve as a guide for other designers who desire to provide practical computer graphics. This graphics system operates under a batch-mode computer system without using interactive terminals. 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
Comparison of Convergence of General Stationary Iterative Methods for Singular Matrices
Authors: Ivo Marek, Daniel B. Szyld
Venue: SIAM Journal on Matrix Analysis and Applications (2002)

New comparison theorems are presented comparing the asymptotic convergence factor of iterative methods for the solution of consistent (as well as inconsistent) singular systems of linear equations. The asymptotic convergence factor of the iteration matrix T is the quantity $\gamma(T) = \max \{ |\lambda| , \lambda \in \sigma(T), \lambda \neq 1\}$, where $\sigma(T)$ is the spectrum of T. In the new theorems, no restrictions are imposed on the projections associated with the two iteration matrices being compared. The splittings of the well-known example of Kaufman [ SIAM J. Sci. Statist. Comput., 4 (1983), pp. 525--552] satisfy the hypotheses of the new theorems.
Ensuring cache freshness in on-demand ad hoc network routing protocols
Authors: Yih-Chun Hu, David B. Johnson
Venue: Proceedings of the second ACM international workshop on Principles of mobile computing (2002)

In a wireless ad hoc network, nodes cooperate to forward packets for each other over possibly multi-hop paths, to allow nodes not within direct wireless transmission range to communicate. Many routing protocols have been proposed for the ad hoc network environment, several of which operate on-demand and utilize a route cache listing links that this node has learned. In such protocols, aggressive caching of overheard routes can significantly improve performance; in particular, overhead can be reduced by leverag-ing information received in packets overheard or forwarded from other nodes, including other routing packets and the source routes on other data packets. Unfortunately, such information sharing can substantially increase the risk of cache cross-pollution, since stale routing information in one node's cache, representing a link that no longer exists, can easily be added into the caches of other nodes. Even when a node has actually learned that a link no longer exists, it is still possible for that node to again hear the stale information. In this paper, we present a new mechanism which we call epoch numbers, to reduce this problem of cache staleness, by preventing the re-learning of stale knowledge of a link after having earlier heard that the link has broken. Our scheme does not rely on ad hoc mechanisms such as short-lived negative caching; rather, we allow a node having heard both of a broken link and a discovery of the same link to sequence the two events in order to determine whether the link break or the link discovery occurred before the other.
On the interdependence of routing and data compression in multi-hop sensor networks
Authors: Anna Scaglione, Sergio D. Servetto
Venue: Proceedings of the 8th annual international conference on Mobile computing and networking (2002)

We consider a problem of broadcast communication in a multi-hop sensor network, in which samples of a random field are collected at each node of the network, and the goal is for all nodes to obtain an estimate of the entire field within a prescribed distortion value. The main idea we explore in this paper is that of jointly compressing the data generated by different nodes as this information travels over multiple hops, to eliminate correlations in the representation of the sampled field. Our main contributions are: (a) we obtain, using simple network flow concepts, conditions on the rate/distortion function of the random field, so as to guarantee that any node can obtain the measurements collected at every other node in the network, quantized to within any prescribed distortion value; and (b), we construct a large class of physically-motivated stochastic models for sensor data, for which we are able to prove that the joint rate/distortion function of all the data generated by the whole network grows slower than the bounds found in (a). A truly novel aspect of our work is the tight coupling between routing and source coding, explicitly formulated in a simple and analytically tractable model---to the best of our knowledge, this connection had not been studied before.
Learn HTML in a Weekend with Cdrom
Authors: Steve Calihan
Venue:  (1998)

:This book's objective is to enable you to say, with confidence, "I know HTML!" Using a graduated approach, you will build up basic-to-intermediate HTML skills and learn how to use software tools for including more "advanced" HTML features (frames, forms, Web graphics, image maps, and GIF animations). Even if you complete only the basic HTML session, you will still know all the HTML you'll need to create fairly sophisticated Web pages right away -- including headings, paragraphs, numbered and bulleted lists, indented quotes, special characters, horizontal rules, hypertext links, inline images, and more. All you need to get started is a copy of Learn HTML In a Weekend, Revised Edition, a current Web browser, and Windows Notepad. All software used in the advanced tutorials is included on the CD-ROM. 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
Computer art for computer people - a syllabus
Authors: Grace C. Hertlein
Venue: ACM SIGGRAPH Computer Graphics (1977)

Given the present state of the art, it is easier to introduce and teach computer art to people who have some background in computer science. Although there are many art-oriented systems for non-programmers, a study of the work of these artist-students reveals that their final products do not surpass the work of programmer-artists. Experience in working with artists and non-programmers during the past seven years has repeatedly shown that computer people, with special guidance and instruction, can and do produce professional looking computer art works that rival and often surpass the works of intermediate to advanced artists who engage in this new medium. However, working with Computer Science people poses unique requirements. Although they produce professional looking works within one semester, their orientation is dominantly practical, and often they will abandon their artistic efforts after the conclusion of their course of study, to aim at more practical, job-oriented skills. This paper describes in detail the course objectives, and includes a listing of lecture/discussiontopics, and offers the reader a schedule of week-by-week presentations and explorations for development in laboratory sessions.
Game Boy Secret Codes
Authors: Brady Games, Michael Owen
Venue:  (2000)

:BradyGAMES Game Boy Secret Codes: This guide is a collection of the best cheats, tricks, codes and strategies for Nintendo's handheld console. Codes and cheats help you uncover secret characters, hidden levels, and all-new modes of game play. Tips and strategies give you the edge over your friends when you compete head-to-head using the GAME BOY link cable. Donkey Kong Land 3, Frogger, Wario Land: Super Mario Land 3, Legend of Zelda: Link's Awakening, Kirby's Dream Land, and Pocket Bomberman are some of the hot titles that will be covered in this guide.
RMDP: an FEC-based reliable multicast protocol for wireless environments
Authors: Luigi Rizzo, Lorenzo Vicisano
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1998)

In this paper we present a Reliable Multicast data Distribution Protocols (RMDP), and discuss its performance. The protocol is based on the use of FEC techniques to drastically reduce the impact of independent losses for different receivers, which make ARQ-based protocols perform very poorly as the number of receivers grows. The protocol is well-suited to the use with mobile equipment because of its simplicity, robustness to losses, moderate demand for feedback, and scalability.
AutoCAD 13 Instant Reference
Authors: George Omura, Paul W. Richardson
Venue:  (1994)

:Here's a concise, alphabetically organized command reference for Windows 3.1, NT, or DOS versions of AutoCAD. Useful for beginners and experienced users alike, this book starts with an overview of new features, then highlights them throughout. Valuable tips, tables, and cross-references help you find just the information you need.
Home Networking with Microsoft® Windows® XP Step by Step
Authors: Matthew Danda, Heather T. Brown
Venue:  (2001)

:Teach yourself just what you need to know about setting up a home network with the Windows XP operating system. With Step By Step, you can work through every lesson in the book or choose your own best starting point. The book uses easy-to-follow instructions and friendly, non-intimidating language to explain how to set up and use a simple Windows XP-based home server. Walk through the steps for creating and configuring a network that connects all the intelligent devices in your home or home-based businesseverything from PCs, printers, and scanners to WebTV&reg;, digital cameras, and the coming wave of "smart" home appliances. STEP BY STEP is the easy way to introduce yourself to Windows XP home networking featuresand build your mastery with everyday tasksone step at a time! Your personal training system of easy step-by-step lessons and practice for using the home-networking features in Windows XP The easiest way to teach yourself how to use Windows XP to connect all the intelligent devices in your homeone step at a time! Key Book Benefits: * Take just the lessons you need or work from cover to coveryou drive the instruction! * Book stays open flat on your desk, so it's easy to read and work at the same time
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
Authors: Fabrice Rastello, Yves Robert
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. whose aim is to minimize the number of accessed data throughout the computation of a tile; this number is called the cumulative footprint of the tile. We improve these results along several directions. First, we derive a new formulation of the cumulative footprint, allowing for an analytical solution of the optimization problem stated in. Second, we deal with arbitrary parallelepiped-shaped tiles, as opposed to rectangular tiles in. We design an efficient heuristic to determine the optimal tile shape in this general setting and we show its usefulness using both examples from and a large collection of randomly generated data.
Computational Intelligence in Software Engineering
Authors: Witold Pedrycz, J. F. Peters
Venue:  (1998)

:This unique volume is the first publication on software engineering and computational intelligence (CI) viewed as a synergistic interplay of neurocomputing, granular computation (including fuzzy sets and rough sets), and evolutionary methods. It presents a unified view of CI in the context of software engineering. The book addresses a number of crucial issues: what is CI, what role does it play in software development, how are CI elements built into successive phases of the software life cycle, and what is the role played by CI in quantifying fundamental features of software artifacts?
WordPerfect 6.1 for Windows for Dummies Quick Reference, 2nd edition
Authors: Greg Harvey, Stuple
Venue:  (1994)

:WordPerfect 6.1 for Windows is brimming with great features that can save you time as well as add professional polish to all your word processing documents. But all those features -- from formatting and printing to spell checking and mail merging -- can be tricky to use. That's why WordPerfect 6.1 For Windows For Dummies Quick Reference, 2nd Edition, is the ideal guide to have on hand whenever you sit down to use WordPerfect. Concise, compact, and understandable, WordPerfect 6.1 For Windows For Dummies Quick Reference, 2nd Edition, not only explains all the important commands and functions but also shows you how to use them on real-world projects like yours. Plus, for those times when you need information that's more in depth, you'll find convenient cross references to the comprehensive WordPerfect 6.1 For Windows For Dummies, 2nd Edition.
Java 2 Exam Prep, Second Edition, 2nd edition
Authors: Bill B. Brogden, William B. Brogden, Marcus Green
Venue:  (2001)

:Java 2 Exam Prep, 2nd Edition is the updated and revised version of one of our best selling titles in the Exam Prep series. This content-rich and highly detailed book gives the reader not only thorough test preparation for the Sun Certified Java Programmer, Java 2 exam (310-025), but also serves as a valuable on-the-job reference. The book covers key test content and objectives like learning Java language fundamentals, creating Java classes, building GUIs with the AWT Components, and working with flow control and exceptions. Exam Prep study guides add even more value to the reader with real-world projects and examples, a CD containing 50 realistic practice test questions, and a feature that allows free electronic downloads of additional questions.