ppxscal/embedding_network huggingface dataset:
How bad is selfish routing?
Authors: Tim Roughgarden, Éva Tardos
Venue: Journal of the ACM (JACM) (2002)

We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route traffic such that the sum of all travel times---the total latency---is minimized.In many settings, it may be expensive or impossible to regulate network traffic so as to implement an optimal assignment of routes. In the absence of regulation by some central authority, we assume that each network user routes its traffic on the minimum-latency path available to it, given the network congestion caused by the other users. In general such a "selfishly motivated" assignment of traffic to paths will not minimize the total latency; hence, this lack of regulation carries the cost of decreased network performance.In this article, we quantify the degradation in network performance due to unregulated traffic. We prove that if the latency of each edge is a linear function of its congestion, then the total latency of the routes chosen by selfish network users is at most 4/3 times the minimum possible total latency (subject to the condition that all traffic must be routed). We also consider the more general setting in which edge latency functions are assumed only to be continuous and nondecreasing in the edge congestion. Here, the total latency of the routes chosen by unregulated selfish network users may be arbitrarily larger than the minimum possible total latency; however, we prove that it is no more than the total latency incurred by optimally routing twice as much traffic.
The Handbook of Applied Expert Systems, 1st edition
Authors: Jay Liebowitz
Venue:  (1997)

:The Handbook of Applied Expert Systems is a landmark work dedicatedsolely to this rapidly advancing area of study. Edited by Jay Liebowitz, a professor, author, and consultant known around the world for his work in the field, this authoritative source covers the latest expert system technologies, applications, methodologies, and practices. The book features contributions from more than 40 of the world's foremost expert systems authorities in industry, government, and academia. The Handbook is organized into two major sections. The first section explains expert systems technologies while the second section focuses on applied examples in a wide variety of industries. Key topics covered include fuzzy systems, genetic algorithm development, machine learning, knowledge representation, and much more.
Towards a world-wide civilization of objects
Authors: Michael Condict, Dejan Milojicic, Franklin Reynolds, Don Bolinger
Venue: Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications (1996)

The Internet today corresponds to a Feudal society, where fortress walls (firewalls) surround villages (LANs), little pockets of civilization connected by lawless highways (insecure networks) infested by bandits (hackers). The emergence of the World Wide Web and Java have shown the way towards a true civilization of electronic objects, although it does not yet exist. To assist in its evolution, we propose to extend the World Wide Web and Java with object-oriented, distributed OS services, implemented in Java. The goal is to make it commonplace for applications and objects to be distributed across unrelated sites and for mobile objects and agents to travel and trade freely around the world. We describe some problems such a system faces, such as in the areas of security and performance, and give a high-level design that addresses them.
Innocent game models of untyped λ-calculus
Authors: Andrew D. Ker, Hanno Nickau, C-H. Luke Ong
Venue: Theoretical Computer Science (2002)

We present a new denotational model for the untyped lgr;-calculus, using the techniques of game semantics. The strategies used are innocent in the sense of Hyland and Ong (Inform. and Comput., to appear) and Nickau (Hereditarily Sequential Functionals: A Game-Theoretic Approach to Sequentiality, Shaker-Verlag, 1996. Dissertation, Universit&auml;t Gesamthochschule Siegen, Shaker-Verlag, 1996), but the traditional distinction between "question" and "answer" moves is removed. We first construct models D and DREC as global sections of a reflexive object in the categories A and AREC of arenas and innocent and recursive innocent strategies, respectively. We show that these are sensible lgr; eegr;-algebras but are neither extensional nor universal. We then introduce a new representation of innocent strategies in an economical form. We show a strong connexion between the economical form of the denotation of a term in the game models and a variable-free form of the Nakajima tree of the term. Using this we show that the definable elements of DREC are precisely what we call effectively almost-everywhere copycat (EAC) strategies. The category AEAC with these strategies as morphisms gives rise to a &lambda;&eta;-model DEAC which we show has the same expressive power as D, i.e. the equational theory of DEAC is the maximal consistent sensible theory H*. We show that the model DEAC is sensible, order-extensional and universal (i.e. every strategy is the denotation of some &lambda;-term). To our knowledge this is the first syntax-free model of the untyped &lambda;-calculus with the universality property. Copyright 2002 Elsevier Science B.V.
Advancing with AutoCAD: Release 13 for Windows with Disk
Authors: Robert McFarlane
Venue:  (1997)

:AutoCAD is the most widely used computer-aided design package in the world. Release 13 for Windows is the latest version of the software. This book is for CAD users with some experience who wish to develop their skills further.
Optimum Image Thresholding via Class Uncertainty and Region Homogeneity
Authors: Punam K. Saha, Jayaram K. Udupa
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

Thresholding is a popular image segmentation method that converts a gray-level image into a binary image. The selection of optimum thresholds has remained a challenge over decades. Besides being a segmentation tool on its own, often it is also a step in many advanced image segmentation techniques in spaces other than the image space. Most of the thresholding methods reported to date are based on histogram analysis using information-theoretic approaches. These methods have not harnessed the information captured in image morphology. Here, we introduce a novel thresholding method that accounts for both intensity-based class uncertainty¿a histogram-based property¿and region homogeneity¿an image morphology-based property. A scale-based formulation is used for region homogeneity computation. At any threshold, intensity-based class uncertainty is computed by fitting a Gaussian to the intensity distribution of each of the two regions segmented at that threshold. The theory of the optimum thresholding method is based on the postulate that objects manifest themselves with fuzzy boundaries in any digital image acquired by an imaging device. The main idea here is to select that threshold at which pixels with high class uncertainty accumulate mostly around object boundaries. To achieve this, a new threshold energy criterion is formulated using class-uncertainty and region homogeneity such that, at any image location, a high energy is created when both class uncertainty and region homogeneity are high or both are low. Finally, the method selects that threshold which corresponds to the minimum overall energy. The method has been compared to a recently-published maximum segmented image information ($MSII$) method. Superiority of the proposed method was observed both qualitatively on clinical medical images as well as quantitatively on 250 realistic phantom images generated by adding different degrees of blurring, noise, and background variation to real objects segmented from clinical images.
Management Information Systems: Managing Information Technology in the Networked Enterprise, 3rd edition
Authors: James A. O'Brien
Venue:  (1998)

:This market leading text is for business students,most of whom will become managers,entrepreneurs,or managerial-level professionals who will use and manage Information Systems. Students learn how Information Technology provides them with a powerful managerial resource that can help manage business operations,make better decisions,and gain competitive advantages. Its goal is to help students become managerial end users who can propose and participate in developing information systems solutions to business problems. This text is distinguished from the competition by its extensive use of up-to-date case material.
Creating Killer Websites: The Art of Third-Generation Site Design
Authors: David S. Siegel
Venue:  (1996)

:Creating Killer Web Sites was the first true design book for the web. It shows, in practical terms, the fundamentals of design applied to the web. Now completely updated! Every chapter has new material! In this expanded second edition, you'll find the techniques and principles you need to build sites for today's 4.0 and the coming 5.0 browsers. Much of the book has been rewritten with new tips, new tools, updated HTML, and an emphasis on cross-browser compatibility. There are three new chapters on strategies designers will need to know going forward, including a detailed style-sheet tutorial.
Emotional dialogue simulator
Authors: William R. Wiltschko
Venue: Proceedings of the 7th international conference on Intelligent user interfaces (2002)

Demonstration of a fielded web-based mixed-initiative emotional natural language dialogue simulator in a game-like computer interface for pedagogical purposes.
The DOOM operating system
Authors: Peter den Haan
Venue: Proceedings of the 2nd workshop on Making distributed systems work (1986)

This paper gives an introduction to the work on the distributed Operating System in the DOOM project.
PC Week Network Buyer's Guide
Authors: Strategic Research Corporation
Venue:  (1996)

:The identification and brief explantions of the salient features and fuctions of products listed here help buyers determine what products are right for them. The table format lists product categories and the presence or absence of important features. 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
Virtual Realities and Their Discontents
Authors: Robert Markley
Venue:  (1995)

:The recognition the cyberspace is a fiction--a narrative that creates a coherence it would like to imagine 'really' exists-is crucial to any theoretically sophisticated critique of the limitations of this consensual hallucination and the discontents it imperfectly masks.
Highly efficient gang scheduling implementation
Authors: Atsushi Hori, Hiroshi Tezuka, Yutaka Ishikawa
Venue: Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM) (1998)

A new and more highly efficient gang scheduling implementation technique is the basis for this paper. Network preemption,in which network interface contexts are saved and restored, has already been proposed to enable parallel applications to perform efficent user-level communication. This network preemption technique can be used to for detecting global state, such as deadlock, of a parallel program execution. A gang scheduler, SCore-D, using the network preemption technique is implemented with PM, a user-level communication library.This paper evaluates network preemption gang scheduling overhead using eight NAS parallel benchmark programs. The results of this evaluation illustrate that the saving and restoring network contexts occupies almost half of the total gang scheduling overhead. A new mechanism, having multiple network contexts and merely switching the context pointers without saving and restoring the network contexts, is proposed.The NAS parallel benchmark evaluation shows that gang scheduling overhead is almost halved. The maximum gang scheduling overhead among benchmark programs is less than 10 % , with a 40 msec time slice on 64 single-way Pentium Pros, connected by Myrinet to form a PC cluster. The numbers of secondary cache misses are counted, and it is found that network preemption with multiple network contexts is more cache-effective than a single network context. The observed scheduling overhead for applications running on 64 nodes can only be a small percent of the execution time. The gang scheduling overheads of switching two NAS parallel benchmark programs are also evaluated. The additional overheads are less than 2% in most cases, with a 100 msec time slice on 64 nodes. This slightly higher scheduling overheads than for switching a single parallel process comes from more frequent cache misses.This paper contributes the following findings; i) gang scheduling overhead with network preemption can be sufficiently low, ii) proposed network preemption with multiple network contexts is more cache-effective than a single network context, and, iii) network preemption can be applied to detect global states of user parallel processes.SCore-D gang scheduler realized by network preemption can utilize processor resources by the detecting the global state of user parallel processes. Network preemption with multiple contexts exhibits highly efficient gang scheduling. The combination of low scheduling overhead and the global state detection mechanism achieves an interactive parallel programming where parallel program development and the production run of parallel programs can be mixed freely.
A Manager's Guide to the Law and Economics of Data Networks, 1st edition
Authors: Jeffrey H. Matsuura
Venue:  (2000)

:Here's the first comprehensive guide for technical professionals that examines the basic legal and economic issues associated with development, operation, and maintenance of data communications networks. It's geared to help you avoid legal liability in data network operations, and it helps you enforce your own legal rights. What's more, the format of A Manager's Guide to the Law and Economics of Data Networks puts immediate answers to daily legal questions at your fingertips. You get a quick yet detailed summary of legal and commercial issues, as well as operational guidance, addressing copyright and trademark protection online; privacy and security of data network content; export controls applied to computer and encryption technologies; negotiating and managing contracts and commercial transactions; managing international ventures; and antitrust compliance. The extensive list of topics covered allows you to plan for and use your data network resources at their full capacity because all your legal and economic questions are answered first. This books helps... >Webmasters avoid legal liability and enforce legal rights associated with website content and online transactions >Network administrators ensure network security and avoid liability related to network use of e-mail, databases, and Internet access >Software developers enforce their rights prior to and during software distribution and use via the Internet or data networks >E-commerce transaction managers and participants develop and conduct secure, enforceable, and accurate online business >Data network professionals comply with U.S. and foreign legal requirementsaffecting electronic transactions and data exchange
Escape from Monkey Island
Authors: Jo Ashburn
Venue:  (2000)

:Clever story-driven walkthrough Details on all characters: friend and foe Comprehensive puzzle hints section Complete inventory list including loot, booty, and other paraphernalia 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
Simulation software: an Operational Research Society survey of academic and industrial users
Authors: Vlatka Hlupic
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

Simulation modeling is being widely used in areas such as manufacturing, health, network communications and military. Such popularity of simulation has resulted in a large number of simulation software tools available on the market. This paper presents the results of a survey on the use of simulation software, which has involved academic and industrial members of the Simulation Study Group of the Operational Research Society of Great Britain. Findings of the survey indicate which types of simulation software are primarily being used, the most common application areas of simulation, users' opinion about software and possible ways of improving simulation software.
Direct Broadcast Satellite Communications: An MPEG Enabled Service, 1st edition
Authors: Donald C. Mead
Venue:  (1999)

:With its higher power and superior video and audio quality, Direct Broadcast Satellite (DBS) communications is proliferating worldwide. Written by a leading DBS authority, this book is required reading for anyone involved in this burgeoning field. This comprehensive reference describes the history and structure of DBS systems, the regulatory environment, the subsystems that support it, and the underlying compression technology that makes it commercially feasible. Direct Broadcast Satellite Communications can be read as a broad overview of DBS systems or can serve as a detailed technical description. In particular, the author thoroughly explains how MPEG compression standards are used to implement modern satellite broadcast systems. 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 new type of information retrieval system
Authors: H. Joel Jeffrey
Venue: Proceedings of the 14th annual Southeast regional conference (1976)

In the period 1964-1968, Peter G. Ossorio [10,11,12] developed and tested, on a pilot study basis, a new approach to the problem of automatic document retrieval. Ossorio's studies were entirely successful, as pilot studies, and show the feasibility of using his approach to produce a new kind of retrieval system.These retrieval systems do not operate by word matching. The basic approach is to simulate the judgement of competent human judges of the conceptual content of each document, and the request. This judgement is then used to retrieve those documents with conceptual content most similar to that of the request.Each document is processed only at the time it is added to the data base, in time linear in the number of words in the document that the system recognizes. The retrieval request is in ordinary English. Time for retrieval is linear in the number of documents on file. Documents are retrieved in order of similarity of conceptual content to that of the request. The system works, in certain respects, better on full text documents, providing better descriptions of document content, and more detailed cross-indexing.The new type of system shows a number of interesting features. Among these are:(1) Much better performance than systems using the old techniques;(2) Faithful representation of the judgement of the person(s) whose judgement is being simulated, thus providing the possibility of individualized retrieval systems;(3) Ability to explain to a user why it retrieved certain documents, and not others. With this information, the user can alter his request, or instruct the system to judge things differently;(4) Automatic recognition of requests the system cannot properly handle;(5) Sub-documentary indexing reflecting heterogeneity of material. As is often the case with a new paradigm, Ossorio's work raises at least as many questions as it answers. This paper presents the new approach, and the results of some first explorations in the new field.
Operating an Emergency Information Service
Authors: Ka-Ping Yee
Venue: Communications of the ACM (2001)

Using the Internet to help cope with disaster.
Mental models of robotic assistants
Authors: Sara Kiesler, Jennifer Goetz
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

If robotic assistants are to be successful, people will need appropriate mental models of what these robots can do and how they operate. We are developing techniques for measuring people's mental models of interactive robots and social agents. We aim to measure the content of these models--if they are anthropomorphic or mechanistic--and the richness of these models (how elaborate or sparse they are; how much confidence people have in them). We report progress here.
Heuretics: The Logic of Invention, 1st edition
Authors: Gregory L. Ulmer
Venue:  (1994)

:In Heuretics--he defined the word as the 'branch of logic that treats the art of discovery or invention' --Ulmer sets forth new methods appropriate for conducting cultural studies research in an age of electronic hypermedia.
Discover Microsoft Publisher 97, 1st edition
Authors: Katherine E. Murray
Venue:  (1997)

:The latest release of Microsoft Publisher 97 puts more desktop publishing power at your disposal than ever before -- and Discover Microsoft Publisher 97 shows you how to use it. In this combined tutorial and reference, author Katherine Murray explains in plain English how to Take advantage of Publisher's built-in Wizards that guide you through producing documents Create eye-catching typography and type graphics with Word Art Incorporate clipart and your own scanned illustrations and photographs Build tables and import them from other programs Mail-merge letters and addresses onto your own custom-designed stationery Design and publish your own personal or business Web page Plus, like all the titles in our Discover series, Discover Microsoft Publisher 97 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-related Web sites Bonus Section -- Added-value tips and timesaving techniques at the end of each chapter
Secure multi-party quantum computation
Authors: Claude Crépeau, Daniel Gottesman, Adam Smith
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are information-theoretically secure, i.e. no assumptions are made on the computational power of the adversary. For the weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t &xi; n/4 cheating parties (out of n). This is shown to be optimal. We use this new tool to show how to perform any multi-party quantum computation as long as the number of dishonest players is less than n/6.