ppxscal/embedding_network huggingface dataset:
A help facility for X window system applications
Authors: Mark Newsome
Venue: Proceedings of the 30th annual Southeast regional conference (1992)

Xhelp is an interactive help facility for X-based applications, providing a friendly, consistent help interface across a variety of applications. Xhelp may be invoked as a standalone utility for tutorials or general system information. Its programmatic interface also reduces the coding effort required to integrate the help facility for automatic invocation by application software.
Learning from Cyber-Savvy Students: How Internet-Age Kids Impact Classroom Teaching
Authors: Anne Hird
Venue:  (2000)

:As the Internet shifts from novelty to common household utility, more and more students are coming to school with Internet experience. How will students' and teachers' roles, and schools as institutions, change as these Internet-Age kids enter classrooms that are fully equipped with networked computers? This book offers a unique preview of the issues and challenges teachers will face as their classrooms become fully connected to the Internet. Anne Hird spent six months observing a class in a school where the future has already arrived. She presents a vivid and insightful account -- often reported through the students' own words -- of how young teens use computers in and out of school; how they perceive the world shaped by the Internet; and how these factors shape their expectations for classroom learning. Hird observes and reflects on the paradox that confronts teachers in this new environment. They are expected to guide students in learning with a cognitive tool that was not part of the teachers' experience as students, while students' familiarity with the Internet calls into question the authority of the teacher on which the traditional teacher-student relationship is based. She offers a strategy for professional development that recognizes and builds on this inevitable shift in the teacher-student relationship. This is an absorbing, thought-provoking, and practical book for all educators -- individual teachers and administrators alike -- concerned about the integration of computer technology into elementary and secondary school classrooms. 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
Maple for Trigonometry, 1st edition
Authors: Richard A. Parker
Venue:  (1997)

:Maple for Trigonometry presents the standard concepts of post-secondary trigonometry are presented from the perspective of a PC-based, interactive computer algebra system. Illustrated by pen and pencil exercises, the step-by-step instructions apply Maple to standard problems. The advantage of using computer algebra is shown by solving problems graphically and numerically prior to showing the exact analytic solution. Problem paradigms are given in Maple laboratory exercises.
When conventions collide: the tensions of instant messaging attributed
Authors: Amy Voida, Wendy C. Newstetter, Elizabeth D. Mynatt
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Changing our world, changing ourselves (2002)

We discuss findings from observation, interviews, and textual analysis of instant messaging use in a university research lab setting. We propose a method for characterizing the tensions that permeate instant messaging texts and that expose the collision between conventions of verbal and written communication. Given this method, we suggest a design space for exploring potential design choices in instant messaging clients. Finally, we recommend an analysis of communicative conventions as a fruitful lens through which designers might anticipate or circumvent design tensions in emergent computer-mediated communication technologies
Net-dbx: A Web-Based Debugger of MPI Programs Over Low-Bandwidth Lines
Authors: Neophytos Neophytou, Paraskevas Evripidou
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

This paper describes Net-dbx, a tool that utilizes Java and other World Wide Web tools for the debugging of MPI programs from anywhere in the Internet. Net-dbx is a source-level interactive debugger with the full power of gdb (the GNU Debugger) augmented with the debug functionality of the public-domain MPI implementation environments. The main effort was on a low overhead, yet powerful, graphical interface supported by low-bandwidth connections. The portability of the tool is of great importance as well because it enables the tool to be used on heterogeneous nodes that participate in an MPI multicomputer. Both needs are satisfied a great deal by the use of WWW browsing tools and the Java programming language. The user of our system simply points his/her browser to the Net-dbx page, logs in to the destination system, and starts debugging by interacting with the tool, just as with any GUI environment. The user can dynamically select which MPI processes to view/debug. A special WWW-based environment has been designed and implemented to host the system prototype.
Algorithm for optimal winner determination in combinatorial auctions
Authors: Tuomas Sandholm
Venue: Artificial Intelligence (2002)

Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-item auctions where the agents' valuations of the items are not additive. However, determining the winners so as to maximize revenue is NP-complete. First, we analyze existing approaches for tackling this problem: exhaustive enumeration, dynamic programming, and restricting the allowable combinations. Second, we study the possibility of approximate winner determination, proving inapproximability in the general case, and discussing approximation algorithms for special cases. We then present our search algorithm for optimal winner determination. Experiments are shown on several bid distributions which we introduce. The algorithm allows combinatorial auctions to scale up to significantly larger numbers of items and bids than prior approaches to optimal winner determination by capitalizing on the fact that the space of bids is sparsely populated in practice. The algorithm does this by provably sufficient selective generation of children in the search tree, by using a secondary search for fast child generation, by using heuristics that are admissible and optimized for speed, and by preprocessing the search space in four ways. Incremental winner determination and quote computation techniques are presented.
C Programmer's Guide to Serial Communications, 2nd edition
Authors: Joe Campbell
Venue:  (1993)

:Comprehensive coverage of serial communications for all intermediate and advanced C programmers. This new edition provides a new perspective on incorporating serial communications with C.Includes new information about Windows and DOS serial communicationsDiscusses the basics of serial communications, ASCII, and RS-232 technologyFilled with inside information to bring developers up-to-date on the latest developments in serial communications
Internet Explorer 5.0 Developer's Guide, 1st edition
Authors: Chuck White
Venue:  (1999)

:A high-level introduction to the techniques Web page designers and Internet and Intranet site builders need to know to fully exploit the capabilities of Microsoft Internet Explorer 5.0. 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
Cell-based first-hit ray casting
Authors: A. Neubauer, L. Mroz, H. Hauser, R. Wegenkittl
Venue: Proceedings of the symposium on Data Visualisation 2002 (2002)

Cell-based first-hit ray casting is a new technique for fast perspective volume visualization. This technique, based on the well known ray casting algorithm, performs iso-surfacing and supports interactive threshold adjustment. It is accelerated by the reduction of average ray path lengths to only a few steps per pixel. The volume is divided into cubic sub volumes. Each sub volume that is intersected by an iso-surface is projected to the image plane. A local ray casting step within the sub volume is performed for each pixel covered by the projection. Cell-based first-hit ray casting is perfectly suited whenever fast perspective iso-surfacing is required. This paper describes the basic algorithm, presents possible optimizations and evaluates the performance of the algorithm for one specific application, the post-implantation assessment of endovascular stent placement. It will be shown that the algorithm, though executed on a single processor machine without any hardware acceleration, performs well for view points inside as well as outside the stented blood vessel and significantly outperforms an optimized, yet more conventional ray casting technique.
CU-See Me
Authors: Bob Rustici
Venue:  (1996)

:Begin with the basics of videoconferencing like putting together a subscriber rig, including camera, software, modem, and ISDN or LAN hookup, and discover how to become a broadcast station with reflectors, unicast, multicast, and MBone network options. Learn how to configure and advertise your station and ensure privacy and conference security with firewalls and proper software configuration. Plus, the user can try CU-SeeMe free for 90 days by using the full version of the software 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
Near-optimal sparse fourier representations via sampling
Authors: A. C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, M. Strauss
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

(MATH) We give an algorithm for finding a Fourier representation R of B terms for a given discrete signal signal A of length N, such that $\|\signal-\repn\|_2^2$ is within the factor (1 +&egr;) of best possible $\|\signal-\repn_\opt\|_2^2$. Our algorithm can access A by reading its values on a sample set T &sube;[0,N), chosen randomly from a (non-product) distribution of our choice, independent of A. That is, we sample non-adaptively. The total time cost of the algorithm is polynomial in B log(N)log(M)&egr; (where M is the ratio of largest to smallest numerical quantity encountered), which implies a similar bound for the number of samples.
Generic Programming for Borland C Plus Plus
Authors: Namir Clement Shammas
Venue:  (1993)

:If you want to learn how to code reusable data Programming for Borland C++. It's packed with all the hands-on guidance you need to create flexible generic libraries for your Borland C++ applications. Author Namir Shammas provides step-by-step instructions and a wealth of helpful examples that demonstrate how to combine generic, structured, and object-oriented programming methods to develop time-saving generic classes you can use in a variety of applications. You'll learn how to create stacks, arrays, linked lists, AVL-trees, queues, matrices, hash tables, and graphs. In addition to including dozens of complete, customizable program listings, Shammas shows you how to enhance generic code using techniques such as inheritance and polymorphism. Generic Programming for Borland C++ also comes with a disk containing all the book's generic data structure class examples.
Microsoft SQL Server 2000 for Dummies with Cdrom
Authors: Anthony T. Mann
Venue:  (2000)

:Network administrators challenged with the task of building and deploying a network database can look to Microsoft SQL Server 2000 For Dummies for simple answers about a complex tool. Microsoft bills its SQL server as the best and fastest network database for NT-based networks and the Internet. Microsoft SQL Server 2000 For Dummies explores the processes and tasks involved with installing, configuring, and using the latest release of Microsoft SQL Server. This book explores designing SQL databases, scaling your server to handle the tasks you need, creating a database system to handle your business, and SQLs tight integration with other Microsoft networking and Internet management products including BackOffice and the rest of the Windows DNA 2000 suite. This book includes a CD that contains such software as IE 5.5, Vision Builder, Vision JADE and sp_Assist.
UNIX Internals: A Practical Approach
Authors: Steve D. Pate
Venue:  (1996)

:This book provides you with the tools and techniques required to explore the UNIX kernel. A practical approach provides a clear and detailed description of the internals of the UNIX kernel, the interface between the user and kernel, and how the kernel interacts with the x86 family of CPUs.
Computing transformation semigroups
Authors: S. A. Linton, G. Pfeiffer, E. F. Robertson, N. Ruskuc
Venue: Journal of Symbolic Computation (2002)

This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R -class in terms of a group and an action. They provide for local computations, concerning a single R -class, without computing the whole semigroup, as well as for computing the global structure of the semigroup. The algorithms have been implemented in the share package MONOID within the GAP system for computational algebra. Copyright 2002 Academic Press
Resident Evil: Survivor
Authors: Dean Evans
Venue:  (2000)

:Youve just survived a helicopter crash near a town where evil resides in a thousand forms. Muster your courage and summon your strength; beat your enemies-killer dogs, lethargic zombies, and the evil Umbrella Corporation. Resident Evil: Survivor--Primas Official Strategy Guide will back you up. This tell-all guide exposes the secrets to each level, solutions to all puzzles, and strategies to defeating every enemy. Hands down the most powerful weapon in your arsenal, this guide tells you how to remain a survivor.
Managing energy and server resources in hosting centers
Authors: Jeffrey S. Chase, Darrell C. Anderson, Prachi N. Thakar, Amin M. Vahdat, Ronald P. Doyle
Venue: Proceedings of the eighteenth ACM symposium on Operating systems principles (2001)

Internet hosting centers serve multiple service sites from a common hardware base. This paper presents the design and implementation of an architecture for resource management in a hosting center operating system, with an emphasis on energy as a driving resource management issue for large server clusters. The goals are to provision server resources for co-hosted services in a way that automatically adapts to offered load, improve the energy efficiency of server clusters by dynamically resizing the active server set, and respond to power supply disruptions or thermal events by degrading service in accordance with negotiated Service Level Agreements (SLAs).Our system is based on an economic approach to managing shared server resources, in which services "bid" for resources as a function of delivered performance. The system continuously monitors load and plans resource allotments by estimating the value of their effects on service performance. A greedy resource allocation algorithm adjusts resource prices to balance supply and demand, allocating resources to their most efficient use. A reconfigurable server switching infrastructure directs request traffic to the servers assigned to each service. Experimental results from a prototype confirm that the system adapts to offered load and resource availability, and can reduce server energy usage by 29% or more for a typical Web workload.
World Wide Web for Teachers
Authors: Brad Williams
Venue:  (1995)

:The World Wide Web For Teachers is written for educators who have heard all the buzz about the information superhighway and realize that the time has come to jump into the driver's seat and take command of the Internet. This book guides you on a step-by-step exploration of the amazing possibilities and educational uses of the World Wide Web in your classroom, including the creation of a custom Web page for yourself or your school and a review of hot teacher-tested Web sites. After you've seen how easy it is to incorporate the Web and other Internet resources into your classroom, your lesson plans will never be the same again! Inside, find guidance on becoming a "techno-teacher" in no time: Discover how to harness the power of the World Wide Web for your classroom and for yourself Create and share personal or school Web pages Try learning-centered activities for using the Internet in your classroom daily Explore thousands of information-rich World Wide Web addresses Evaluate strategies for creating an Acceptable Use Policy to help focus Internet activities on appropriate classroom use Build your own custom Bookmark files categorized for easy use in the classroom 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
Looking for Love on-Line: How to Meet Women on the Internet and Online Services
Authors: Richard M. Rogers
Venue:  (1996)

:The ancient quest to find a mate has entered the computer age: each day, tens of thousands of people log on to the Internet or online services to chat, flirt, and form relationships. Looking for Love Online shows you how you can enter this exciting new cyberspace dating scene! You don't need to be a computer genius to get in on the action. In a few quick lessons, author Richard M. Rogers - himself a successful online suitor - will show you how to mingle in chat rooms, forums, and online dating services. Once you've successfully booted up, you'll learn: where the singles are - virtual 'hot spots', what to say - and what not to say - when you meet people in cyberspace, how to get your meaning across when you're not face to face, how to screen online strangers to find someone who's right for you, how to turn an online virtual relationship into a real-life romance, and detecting online 'lines' and other cyberscams.
Building an Intelligent E-Business with Cdrom
Authors: David Ferris
Venue:  (2000)

:E-Business is booming and you can't afford to be left behind. You can't afford to do it wrong, either. Building an Intelligent E-Business lays the groundwork for understanding this cutting-edge business arena and shows you how to cut through the hype and get to core of e-business. Going beyond just e-commerce, this book covers supply chain management, customer service, successful user interfaces, security, data management, and much more. Written by the chief technologist of a leading e-commerce consulting company, Building an Intelligent E-Business helps you develop a blueprint of a successful e-business plan. 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
A heuristic approach for solving decentralized-POMDP: assessment on the pursuit problem
Authors: Iadine Chades, Bruno Scherrer, François Charpillet
Venue: Proceedings of the 2002 ACM symposium on Applied computing (2002)

Defining the behaviour of a set of situated agents, such that a collaborative problem can be solved is a key issue in multi-agent systems. In this paper, we formulate this problem from the decision theoretic perspective using the framework of Decentralized Partially Observable Markov Decision Processes (DEC-POMDP). Formulating the coordination problem in this way provides a formal foundation for study of cooperation activities. But, as it has been recently shown solving DEC-POMDP is NEXP-complete and thus it is not a realistic approach for the design of agent cooperation policies. However, we demonstrate in this paper that it is not completely desperate. Indeed, we propose an heuristic approach for solving DEC-POMDP when agents are memory-less and when the global reward function can be broken up into a sum of local reward functions. We demonstrate experimentally on an example (the so-called pursuit problem) that this heuristic is efficient within a few iteration steps.
Access 97 Unleashed with CD-ROM, 2nd edition
Authors: Dwayne Gifford
Venue:  (1996)

:Access, one of Microsoft's database managers for Windows, has become one of the most accepted standards of database management for personal computers. The Unleashed format for this book allows current and new users to quickly find and easily find the information they need on the new features. It also serves as a complete reference for database programmers new to Access.Readers learn advanced techniques for working with tables, queries, forms, and dataShows how to program Access and how to integrate the database with the InternetCD-ROM includes Access utilities and applications and an electronic Access reference library
1-2-3 for Windows 5 for Dummies: Quick Reference
Authors: John Walkenbach
Venue:  (1994)

:1-2-3 For Windows 5 For Dummies Quick Reference should be standard issue for every Lotus 1-2-3 user. Organized for instant access, this compact volume not only offers commands, keyboard shortcuts, and techniques, but also features real-world examples showing each 1-2-3 feature in action. You'll do more -- and do it better and faster - with 1-2-3 For Windows 5 For Dummies Quick Reference at your side whenever you use this leading spreadsheet program.
Porting UNIX Applications to Windows NT with Cdrom
Authors: Andrew Lowe
Venue:  (1997)

:With Windows NT rapidly becoming accepted as the alternative operating system, many software engineers have begun the process of porting UNIX applications to Windows NT. This book will provide detailed comparisons of Windows NT's DCE environment with that of UNIX, and discussions of Windows NT architecture for system and applications programmers. 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
On the statistical independence of compound pseudorandom numbers over part of the period
Authors: Mordechay B. Levin
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2001)

This article deals with the compound methods with modulus m for generating uniform pseudorandom numbers, which have been introduced recently. Equidistribution and statistical independence properties of the generated sequences over part of the period are studied based on the discrepancy of d-tuples of successive pseudorandom numbers. It is shown that there exist parameters in compound methods such that the discrepancy over part of the period of the corresponding point sets in the d-dimensional unit cube is of an order magnitude of O(N-1/2 (log N)d+3) for all N=1, …, m. This result is applied to the compound nonlinear, inversive and explicit inversive congruential methods.