ppxscal/embedding_network huggingface dataset:
Advanced eager scheduling for Java-based adaptively parallel computing
Authors: Michael O. Neary, Peter Cappello
Venue: Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande (2002)

Javelin 3 is a software system for developing large-scale, fault tolerant, adaptively parallel applications. When all or part of their application can be cast as a master-worker or branch-and-bound computation, Javelin 3 frees application developers from concerns about inter-processor communication and fault tolerance among networked hosts, allowing them to focus on the underlying application. The paper describes a fault tolerant task scheduler and its performance analysis. The task scheduler integrates work stealing with an advanced form of eager scheduling. It enables dynamic task decomposition, which improves host load-balancing in the presence of tasks whose non-uniform computational load is evident only at execution time. Speedup measurements are presented of actual performance on up to 1,000 hosts. We analyze the expected performance degradation due to unresponsive hosts, and measure actual performance degradation due to unresponsive hosts.
Coloring Hamming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions
Authors: Günter M. Ziegler
Venue: Computational Discrete Mathematics: advanced lectures (2001)

The o/1-Borsuk problem asks whether every subset of {0,1}d can be partitioned into at most d=1 sets of smaller diameter. This is known to be false in high dimensions (in particular for d&ge;561, due to Kahn & Kalai, Nilli, and Raigorodskii), and yields the known counterexamples to Borsuk's problem posed in 1933. Here we ask whether there might be counterexamples in low dimension as well. We show that there is no counterexample to the 0/1-Borsuk conjecture in dimensions d&le;9. (In contrast, the general Borsuk conjecture is open even for d=4.) Our study relates the 0/1-case of Borsuk's problem to the coloring problem for the Hamming graphs, to the geometry of a Hamming code, as well as to some upper bounds for the sizes of binary codes.
Windows Development Netwa Sys
Authors: Lori Gauthier, Sue Whitehead
Venue:  (1993)

:Windows Development on NetWare Systems is a practical, hands-on guide that tells you everything you need to know to make your applications Windows-aware and take advantage of the power and performance of the number one network operating system in the world. In addition to including plenty of helpful programming tips, techniques, and working sample code for network applications, expert Novell programmers Lori Gauthier and Sue Whitehead provide detailed explanations of the protocols used in a variety of applications, including the bindery; NetWare directory services; file, directory, and synchronization services; QMS services; print server services; IPX services; and management and security services available to your application through NetWare.
Microsoft Office XP Step by Step
Authors: Kristen Crupi
Venue:  (2001)

:Microsoft Office is one of the most efficient suite of applications for creating documents, communicating, and analyzing business information. Office XP continues to extend desktop productivity to the Web, streamlining the way you work and making it easier to access and share information so you get better results. Microsoft Office XP Step by Step offers self-paced instruction to the beginning-to-advanced user who wants to get the most out of Office XP-and prepare for Microsoft Office User (MOUS) certification. This personal training system offers easy-to-follow lessons full of clear objectives, a wealth of task-oriented procedures, and dozens of real-world business scenarios. Each Step by Step title consists of friendly, straightforward instruction with dozens of full-color screenshots and illustrations to help you learn exactly what you need to know at your own pace. A companion CD-ROM includes practice files that are tightly integrated with the lessons, plus movie-style demonstrations of key procedures. Other features include a "QuickLook Guide" for easy visual navigation, a "Finding the Best Starting Point for You" section to help you decide how to the most out of the book, and a special lay-flat binding to keep the book open during lessons. 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
The Internet Guide for Seniors
Authors: Peter Cook
Venue:  (2001)

:Senior citizens are one of the fastest-growing segments of the online populationand a strong book-buying population as well. But until now there has been no easy-to-use Internet guide specifically aimed at an older audience, and designed to be helpful both to novices looking to e-mail their grandchildren, and to people with some computer familiarity (from work, for instance). This guide, intended for the over-55 market, brings a friendly, no-nonsense approach to getting seniors up and running on the Internet. Sidebars featuring the experiences of actual seniors in getting connected and using the Internet help bring the text to life for readers. In addition to information on how to use the Internet, the book also includes an extensive review of appropriate sites and resources, a user-friendly look at where to go and what to do online. Hints and tips for both novice and more advanced users help readers simplify computer selection and setup, E-mail use, Web navigation, and use of the Internet in a variety of ways of interest to seniors. About the Authors: Peter Cook is co-host of the weekly live, call-in radio program, The CompuDudes. He teaches at Temple University and Penn State University, where his courses include "Introduction to the Internet," "Internet for Seniors," and "Ethics and the Internet." He has made appearances on Appearances on NPR's Talk of the Nation, Fox TV Network, and The Learning Channel, and is co-author of Ask the CompuDudes. Lisa Jo Rudy has over ten years experience as writer, multimedia developer, and consultant specializing in science and technology education. She is a faculty member at the University of Pennsylvania. 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
Specification and verification of abstract database types
Authors: David Stemple, Tim Sheard
Venue: Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems (1984)

A database system, comprising a schema, integrity constraints, transactions, and queries, constitutes a single abstract data type. This type, which we call an abstract database type, has as its object the database itself. Thus, the value set of such a type is the set of all legal database states, legal in the sense of obeying all the structural specifications of the schema and the semantic prescriptions of the integrity constraints. The database transactions are the operations of the abstract database type and must be functions on the value set of the type. A transaction specification is safe if it defines a function which is closed on the database state set, i. e., any execution of the transaction on a legal database yields a legal database.We propose an approach to the definition of abstract database types which is both usable by typical database designers and which facilitates the mechanical verification of transaction safety. The Boyer and Moore theorem proving technique is used to prove transaction safety theorems using abstract data type axioms and recursive functions generated from the database schema and transaction programs.
Microsoft 2000 Windows Server for Dummies, 1st edition
Authors: Ed Tittel, Mary Madden, James Michael Stewart
Venue:  (1999)

:Windows 2000 Server For Dummies provides networking basics needed to set up and maintain a successful network, including how to figure out the best configuration of Windows 2000 server and client stations. The new edition will include more information about Windows 2000 integration with Internet Information Server for intranet and Web publishing, administering the new Active Directory for managing critical application and resource deployment issues, maintaining a secure and private network without sacrificing network efficiency, setting up shop for electronic commerce with Windows 2000 Server, and other important, dynamic topics.
High-Level Feedback Control with Neural Networks
Authors: Young H. Kim, F. L. Lewis
Venue:  (1998)

:Complex industrial or robotic systems with uncertainty and disturbances are difficult to control. As system uncertainty or performance requirements increase, it becomes necessary to augment traditional feedback controllers with additional feedback loops that effectively "add intelligence" to the system. Some theories of artificial intelligence (AI) are now showing how complex machine systems should mimic human cognitive and biological processes to improve their capabilities for dealing with uncertainty.This book bridges the gap between feedback control and AI. It provides design techniques for "high-level" neural-network feedback-control topologies that contain servo-level feedback-control loops as well as AI decision and training at the higher levels. Several advanced feedback topologies containing neural networks are presented, including "dynamic output feedback", "reinforcement learning" and "optimal design", as well as a "fuzzy-logic reinforcement" controller. The control topologies are intuitive, yet are derived using sound mathematical principles where proofs of stability are given so that closed-loop performance can be relied upon in using these control systems. Computer-simulation examples are given to illustrate the performance.
Renegades of the Empire: How Three Software Warriors Started a Revolution behind the Walls of Fortress Microsoft
Authors: Michael Drummond, Microsoft Corporation
Venue:  (1999)

:Competing in the high-tech computer market is a lot like war - especially if you work at Microsoft. Bill Gates's gladiators - his engineers and evangelists and programmers - were famous for seizing new terrain, converting nonbelievers, and always winning, no matter what the cost. No one took the lessons of the Microsoft way more to heart than Craig Eisler, Eric Engstrom, and Alex St. John, a trio of evangelists and software engineers who, more than anything, wanted to conquer a market on their own.. "Their first attempt was a top-secret effort to make Windows do what it had never done before: play games. Turning their well-honed combat skills on their own company, the trio - often called the "Beastie Boys" - rammed DirectX, their game project, through, first without permission, then without regard for political correctness, protocol, or budget restraints. The battle spilled from the halls of Microsoft into the international gaming community, but within months, DirectX was being used in every one of the best-selling games for the PC.. "The "Beastie Boys" had won the battle, but they received so few rewards that they felt as if they'd lost the war. So they set their sights on the Internet. Their new project: Chrome, a Web browser that could bring television-quality animated graphics to the Internet. It was every Microsoft marketer's dream, every competitor's nightmare. It should have changed the Internet and the lives of millions, none more than those of the three designers.. "Michael Drummond gained exclusive access to this trio's story - the tale of a rise, a fall, and, perhaps, a triumph.
Microsoft FrontPage 2000 Unleashed
Authors: William R. Stanek, Susan Dunn, Angela Kozlowski
Venue:  (1999)

:FrontPage 2000 Unleashed is a completely revised edition of the top selling FrontPage book, Microsoft FrontPage 98 Unleashed. The book is designed to be the most comprehensive guide to FrontPage 2000 on the market and inside its covers, you'll find 61 chapters and nearly 1,000 pagesall packed with useful information, tips and advice. Author William Stanek is a leading author and educator in the FrontPage community.
Calibration as parameter estimation in sensor networks
Authors: Kamin Whitehouse, David Culler
Venue: Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications (2002)

We describe an ad-hoc localization system for sensor networks and explain why traditional calibration methods are inadequate for this system. Building upon previous work, we frame calibration as a parameter estimation problem; we parameterize each device and choose the values of those parameters that optimize the overall system performance. This method reduces our average error from 74.6% without calibration to 10.1%. We propose ways to expand this technique to a method of autocalibration for localization as well as to other sensor network applications.
Computer Modelling and Expert Systems in Marketing
Authors: Luiz Moutinho, Bruce Curry, Fiona Davies, Paulo Rita
Venue:  (1994)

:This is the first volume directly to apply discussion of expert systems and computer simulation models to the area of marketing management. Drawing on original research, the authors show how the use of knowledge-based systems and computerised modelling procedures can improve managerial decision-making. The first section of the book looks at the concepts involved, giving examples of spreadsheets and databases, and a review of marketing expert systems. The second section then concentrates on the background and operation of several knowledge bases designed for specific marketing problems. The emphasis throughout is on practical application and the provision of a variety of case studies, and interesting examples will inspire and enable readers to develop their own models in a variety of different settings. This volume provides an excellent framework for development in this growing area and will be of great interest to students and researchers in information technology, marketing and related disciplines.
Polynomial ideals for sandpiles and their Gr&ouml;bner bases
Authors: Robert Cori, Dominique Rossin, Bruno Salvy
Venue: Theoretical Computer Science (2002)

A polynomial ideal encoding topplings in the abelian sandpile model on a graph is introduced. A Grbner basis of this ideal is interpreted combinatorially in terms of well-connected subgraphs. This gives rise to algorithms to determine the identity and the operation in the group of recurrent configurations.
Software Metrics for Product Assesment
Authors: Richard Bache, Gualtiero Bazanna
Venue:  (1993)

:It is only recently that there has been an awareness of measurement in software engineering. Prior to this everybody knew that there was a problem with poor software quality and productivity, but few people bothered to quantify the situation. This book addresses this problem.The book evolved out of a CEC funded project, SCOPE, which is concerned with software assessment for certification. Thus the book provides a comprehensive approach to product based assessment. The authors speak from genuine experience of software measurement programmes and the techniques they describe are not just theory they have been tried and tested in real projects.Special features of the book are: a full description of product-based certification a summary of how metrics can be used for assessment and examples from industrial case studies.
Sams Teach Yourself C++ for Linux in 21 Days, 1st edition
Authors: Jesse Liberty, David Horvath
Venue:  (2000)

:Sams Teach Yourself C++ Programming for Linux in 21 Days teaches you the C++ programming language using the Linux operating system. You will gain a thorough understanding of the basics of C++ programming from a Linux perspective. The Bonus Week includes topics such as XWindows, KDE with QT toolkit, APE Class Library, and Real -time Middleware. This book is written by two best selling authors of books on C++ and Linux, both leading authorities on their subject.
PC Is Not a Typewriter: A Style Manual for Creating Professional-Level Type on Your Personal Computer, 1st edition
Authors: Robin Williams, Busch
Venue:  (1995)

:Ever wonder why some type looks more professional, more sophisticated than other type? The answer lies in the techniques and rules developed for professional typesetting. Not surprisingly, those methods are far different than the training given in Typing 1A. This book not only lays down the principles governing traditional type, but explains the logic behind them. The original bestselling version, entitled The Mac is not a typewriter, received scores of rave reviews and won the prestigious Benjamin Franklin Award from the Publishers Marketing Association. Tailored specifically for users of IBM-compatible computers, this new edition will introduce thousands more to the secrets of beautiful, sophisticated pages.
Using and Upgrading PCs
Authors: Winn L. Rosch, Joe Kraynak
Venue:  (1998)

:Book Description The reader will be able to navigate and utilize the information in the text no matter what their ultimate goal may be. Reader may look at the text from a mainly referential organization, with stepped instructions to augment and support the reader experience. Navigation and accessibility of relevant content?through a series of augmented indices, jump tables, margin notes, and exercise tracks, the consumer should have no trouble navigating the text and making full use of ALL the information provided. Special added Section: Condensed Computer and Internet Dictionary?more than just a glossary of terms. The right price/content value proposition?there is a need for a book at roughly 600 pages and $29.99 to give consumers a better choice and valueThe PC user is maturing and needs coverage beyond beginner level to increas productivity and efficiency when using her PC. The PC sales market has identified that repeat/upgrade purchase are exceeding first-time purchases.At 600 pages and $29.99, this book offers the right amount of coverage of upgrade information on hardware and software and increases performance issues at a good value.
Learning Algorithms for Markov Decision Processes with Average Cost
Authors: J. Abounadi, D. Bertsekas, V. S. Borkar
Venue: SIAM Journal on Control and Optimization (2001)

This paper gives the first rigorous convergence analysis of analogues of Watkins's Q-learning algorithm, applied to average cost control of finite-state Markov chains. We discuss two algorithms which may be viewed as stochastic approximation counterparts of two existing algorithms for recursively computing the value function of the average cost problem---the traditional relative value iteration (RVI) algorithm and a recent algorithm of Bertsekas based on the stochastic shortest path (SSP) formulation of the problem. Both synchronous and asynchronous implementations are considered and analyzed using the ODE method. This involves establishing asymptotic stability of associated ODE limits. The SSP algorithm also uses ideas from two-time-scale stochastic approximation.
Internet Based Learning: An Introduction and Framework for Higher Education and Business, 1st edition
Authors: Charles Johnson, Charles Hale
Venue:  (1998)

:This book is for every teacher or trainerwhose computer skills may be limitedwho wants to understand the Internet educationally, and use it in his or her courses. As institutional pressures mount to integrate the Internet into teaching, this book provides a framework and a hands-on introduction to whats involved, whether its adapting materials and teaching styles for the Web, or designing a virtual course. This book provides:an introduction to the key educational concepts needed to adapt teaching methods and materials to the medium of the Internet an introduction to both basic and advanced Internet skills-from using e-mail to collaborative conferencing a framework for harnessing the Internet to achieve educational goals, and successfully exploiting its resources, features and applications to promote effective learning The framework starts from the premise that teachers should progressively apply Internet technology as their skills and confidence develop. It develops the concept of augmented teaching stylessupplementing traditional teaching with Intenet based options; demonstrates how to use modules as the building blocks for Web-based learning; and shows how to use the Internet to deliver individualized learning, by enhancing personal communication between teacher and student, and addressing the diversity of learning styles. The book abounds with inspiring and thought-provoking examples of Internet course materials developed by a wide variety of teachers and trainers, including modules and forms created by the authors who have extensive experience in delivering Internet-based courses. A glossary of terms and directory of Internet sites and resources complete the book, which is also supported by a related Web site.
Mastering Cold Fusion 4
Authors: Arman Danesh, Kristin Aileen Motlagh
Venue:  (1999)

:Allaire's Cold Fusion is the leading development tool for building complex, interactive Web sites (it competes with Microsoft Visual InterDev). Mastering Cold Fusion 4 is aimed at experienced HTML programmers who need to learn the ins and outs of the software, as well as upgraders to the new version. One of the authors, Kristin Motlagh, is a member of Team Allaire, a select group of Cold Fusion experts, and she understands what new users need to know to get up to speed with this complex product. The book includes information on both the Cold Fusion Application Server and CF Studio, as well as reference material on Cold Fusion tags, SQL, and other topics. The companion CD comes with an evaluation version of the product, an exensive collection of custom tags created by the authors, and a wide variety of sample applications and code from the book.
Review of Parameterized Complexity by R. Downey and M. Fellows
Authors: Gabriel Istrate
Venue: ACM SIGACT News (2000)

One of the most pervasive critiques of Computational Complexity, coming from the applied Computer Science community, is that it is an abstract, largely irrelevant field, that fails to capture the various intuitions concerning the complexity of "real-world" instances they have gathered through experiments. One aspect of these intuitions is that while most problems of practical interest tend to be intractable from a standard complexity-theoretic point of view, in many cases such problems have natural "structural" parameters, and practically relevant instances are often associated with "small" values of these parameters.Parameterized Complexity is an extension of Complexity Theory that attempts to formalize and deal with this intuition. It has already been applied to fields such as Databases, Logic and Constraint Programming, Computational Biology, Nonmonotonic Reasoning, Natural Language Processing, Cognitive Science, and Robotics. Some of its ideas have even been discovered independently by practitioners working in these areas. We do not attempt a further presentation (the interested reader can consult two excellent surveys [DF99, DFS99]), but want to illustrate this point through a revealing example: it has long been known that the register-allocation problem for imperative programming language amounts to a coloring problem on the associated control-flow graph, thus it seems, at a first glance, hard even in an approximate sense. On the other hand Thorup [Th98] has shown that such graphs are characterized by a bounded value (at most 10) of an intrinsic parameter called treewidth, that guarantees the existence of an approximation algorithm with substantially better performance than the one available for general graphs.The present book is an attempt to a first presentation of this emerging area by two of its most active proponents.