ppxscal/embedding_network huggingface dataset:
Microsoft Excel 2000, 1st edition
Authors: Tim Duffy
Venue:  (1999)

:Before starting the keystrokes of a project, Duffy takes more time to explain the significance of what students are about to do and learn. This conceptual approach builds computer skills and encourages critical thinking. After completing the projects in these books, readers will be prepared to take the core Microsoft Certification exams for Word 2000, Excel 2000, Access 2000, PowerPoint 2000, Outlook 2000, and FrontPage 2000. Successful completion of these exams gives readers measurable, marketable skills. For anyone interested in learning Microsoft Office 2000.
Burst tries: a fast, efficient data structure for string keys
Authors: Steffen Heinz, Justin Zobel, Hugh E. Williams
Venue: ACM Transactions on Information Systems (TOIS) (2002)

Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each distinct word in the text, containing the word itself and information such as counters. We propose a new data structure, the burst trie, that has significant advantages over existing options for such applications: it uses about the same memory as a binary search tree; it is as fast as a trie; and, while not as fast as a hash table, a burst trie maintains the strings in sorted or near-sorted order. In this paper we describe burst tries and explore the parameters that govern their performance. We experimentally determine good choices of parameters, and compare burst tries to other structures used for the same task, with a variety of data sets. These experiments show that the burst trie is particularly effective for the skewed frequency distributions common in text collections, and dramatically outperforms all other data structures for the task of managing strings while maintaining sort order.
Neighborhood unions and regularity in graphs
Authors: O. Favaron, Y. Redouane
Venue: Theoretical Computer Science (2001)

One way to generalize the concept of degree in a graph is to consider the neighborhood N(S) of an independent set S instead of a simple vertex. The minimum generalized degree of order t of G is then defined, for 1&le;t&le;&agr; (the independence number of G), by ut=min{|N(S)|: S (semi-circle right) V; S is independent and |S| = t}. The graph G is said to be u(sub)t-regular if |N(S1)| = |N(S2)| for every pair S1; S2 of independent sets of t elements, totally u(sub)t-regular (resp. totally u(sub)t&le;s-regular where s is given &le;&agr;) if it is u(sub)t-regular for every t&le;&agr; (resp. for every t&le;s), strongly u(sub)t-regular (resp. strongly u(sub)t6s-regular) if |N(S1)| = |N(S2)| for every pair S1; S2 of independent sets of G (resp. every pair of independent sets of order at most s). We determine the strongly u(sub)t&le;2-regular graphs and give some properties of the totally u(sub)t&le;2-regular and totally u(sub)t-regular graphs. Some of our results improve already known results.
Convenient abstractions in stormcast applications
Authors: Dag Johansen, Gunnar Hartvigsen
Venue: Proceedings of the 6th workshop on ACM SIGOPS European workshop: Matching operating systems to application needs (1994)

In this paper we present experience with meteorology applications and appropriate distributed computing abstractions. We focus on the need for co-existence and integration of multiple paradigms in large scale distributed applications, rather than enforcing a favourite paradigm whenever possible.
Investigating Computer- Related Crime a Handbook for Corporate Investigators, 1st edition
Authors: Peter Stephenson
Venue:  (1999)

:Written by an experienced information security specialist Investigating Computer-Related Crime discusses the nature of cyber crime, its impact in the 21st century, its investigation and the difficulties encountered by both public law enforcement officials as well as private investigators.. "It is tailored especially for corporate information professionals and investigators to offer a step-by-step approach to understanding and investigating security problems, technical and legal information, and computer forensic techniques.
Online Investing: The Wall Street Journal Interactive Edition's Complete Guide to Becoming a Successful Online Investor, 1st edition
Authors: Dave Pettit
Venue:  (2000)

:The only book investors need to reap the rewards and avoid the treacheries of the investing cyber jungle.When it comes to personal investing, the Internet has changed all the rules. The sophisticated tools and access to information once enjoyed only by financial professionals and the most well-heeled of investors are now easily available to anyone with a computer and a modem. But online investing can be a treacherous cyber jungle. Who better than the reporters and editors of The Wall Street Journal Interactive Edition, the online version of The Wall Street Journal, the world's most authoritative source of business and financial information, to provide you with the best and most complete coverage of everything you need to know about online investing?This is a book any investor can use, whether you're just starting a portfolio or have years of experience in the markets. Online Investing provides basic, must-know information on stocks, mutual funds, and bonds. It then shows how to take advantage of the vast power of the Internet to become a savvy and successful investor. The coverage includes:How to trade stocks online (and a rundown on the biggest, most popular online trading firms) How to use the Internet to research and take part in initial public offerings (IPOs)The online resources for choosing the best mutual fundsHow to navigate the complicated world of bonds, futures, and optionsTools of the trade. A guide to the wealth of information and resources available on the Net: from stock quotes and news stories to Wall Street research reports, corporate documents, investment primers, and sophisticatedspreadsheetsHow to find a message board for your investing needs and interpret the information you findHow to spot scams and deceptionsRecourse: What to do if you lose money, have a dispute with your broker, or are scammedElectronic banking: How to use the Web to get the best deals on credit cards, mortgages, and insurance 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
Acrobat 3.0 (Classroom in a Book), 1st edition
Authors: Adobe Press
Venue:  (1997)

:Adobe Acrobat 3.0 Classroom in a Book covers a wide range of features, tools, and techniques of Adobe Acrobat 3.0 or later. Even if you are familiar with Adobe Acrobat, take the time to review all the lessons - you'll be surprised by how much you learn! If you are a novice, work with each lesson as many times as you want, and then move on to the next lesson. By the end of the book, you'll know Acrobat like a pro!
Excellence in support or support is more than a correct answer
Authors: Jayne Ashworth
Venue: Proceedings of the 29th annual ACM SIGUCCS conference on User services (2001)

Your telephone rings, you answer, and it is a customer with a question. You provide the answer, check to see that it has been understood, wait to see if it fixes the problem and, when it does, thank the customer for calling and move on to your next task. Some would feel that this scenario defines excellence in computer support for our customers. And yet, excellence in support is so much more than having the right response to provide. It also involves being able to:empathize with our customersthink "outside the box" for solutionstalk knowledgeably about cutting-or-bleeding-edge technology with early-adopters on our campusesproactively respond to problems you know that they will have (but they may not anticipate)understand the planned future directions information technology (IT) may take on our campusesanticipate what advances the IT industry may provide and how these will affect usAt the University of Virginia (U.Va.), we in the central ITC organization try to offer our customers (the students, faculty and staff with direct questions, our colleagues who provide departmental computer support and each other) excellence in support, which is why we strive not only to find ways to stay abreast of new developments but also to share information with each other, with our colleagues providing support in departments, and with our customers.
Upgrading and Maintaining Your PC, 3rd edition
Authors: H. Veddeler
Venue:  (1994)

:Buying a personal computer is a major investment. Today's fast-changing technology and innovations, such as Windows NT, ISDN cards and super fast components, require that you upgrade to keep your system current. New hardware and software developments require more speed, more memory and larger capacities. This book is for the millions of PC owners who want to retain their sizable investment in their PC system by upgrading.With current info on the newest technology, Upgrading & Maintaining Your PC starts by helping readers make informed purchasing decisions. Whether it's a larger hard drive, more memory or a new CD-ROM drive, you'll be able to buy components with confidence. Clear and easy-to-understand instructions with numerous photos guide you through today's most common upgrades and repairs. From the fastest processors and clock-doublers to the most modern multimedia components or simply replacing your battery, Upgrading & Maintaining Your PC covers it all.
Compiler optimizations for Java aglets in distributed data intensive applications
Authors: Abhishek Singh, Santosh Pande
Venue: Proceedings of the 2002 ACM symposium on Applied computing (2002)

Code migration in light of distributed data intensive computing poses interesting compilation issues. In this work, we first define a small extension to the aglet model to allow data distribution. In our aglet program, data is distributed over the network using annotations (this is similar to High Performance Fortran (HPF) where the programmer specifies data distributions through annotations). We analyze the program using the annotations and use the 'owner computes' rule to determine where a given computation should take place. The compiler then schedules the aglet through the network and also determines the data it should carry during its migration. Determining efficient schedule of the aglet and which data to carry during migration poses interesting issues.We propose two strategies to optimize the aglet schedule. The first strategy called Take All Live Data: (TALD) attempts to carry all the live definitions of variables from a given node when visited. The second strategy Take Only Needed Data (TOND) attempts to carry only those definitions whose uses are in the destination node. The goal of the first strategy is to minimize the number of migrations which are expensive due to high serialization overheads The second strategy aims to minimize bandwidth consumption during a migration. This could significantly reduce the communication overhead due to minimal amount of data carried during each migration. We have implemented both the strategies in the Jikes compiler from IBM. We have evaluated it on a distributed database application and show benefits of both the strategies on large and small databases. The results show that strategies generated by our compiler analysis reduce the overheads and improve execution time.
Prediction-based concurrency control for a large scale networked virtual environment supporting various navigation speeds
Authors: Eunhee Lee, Dongman Lee, Seunghyun Han, Soon J. Hyun
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2001)

Shared sense of a virtual world is often enhanced by replicating the information at each user's site since replication provides acceptable interactive performance, especially when users are geographically distributed over large networks like the Internet. However, multiple concurrent updates may lead to inconsistent views among replicas. Therefore concurrency control is a key factor to maintaining a consistent state among replicas. We proposed a scalable prediction-based scheme in which an ownership request is multicasted to only the users surrounding a target entity. In our previous work, we assumed that all the users navigate a virtual world with a single speed. It, however, is quite common in a networked virtual environment like a network game that users are allowed to change their navigation speed as they interact with a virtual world for adding more realism. This paper proposes an enhancement to support users with various speeds. The enhanced scheme allows as many Entity Radii as the number of different speed and allocates a separate queue for users of each speed. Each queue is examined in parallel to predict the next owner candidate and among the selected candidates is chosen the final candidate, which has a minimum predicted collision time. It contributes to the timely advanced transfer of ownership by using appropriate Entity Radius based on a user's speed, fair granting of ownership by reducing the interference between users with different speed and latency, and high prediction accuracy by reducing the redundant ownership transfer.
The Internet Publicity Guide: How to Maximize Your Marketing and Promotion in Cyberspace
Authors: V. A. Shiva
Venue:  (1997)

:The Internet Publicity Guide is a complete and practical explanation of the opportunities on the Internet and World Wide Web for businesses and individuals who want to publicize, market, and promote their products or themselves. V. A. Shiva explains how interactive marketing differs from conventional marketing and provides the knowledge and tools that will enable entrepreneurs and large companies to promote themselves successfully online. He describes the benefits of narrowcasting, niche marketing that is cost-prohibitive in conventional advertising media; cross-promotion, integrating your Website in a cohesive multimedia publicity program; the correct "netiquette" for selling through newsgroups; designing a home page to attract and direct potential customers; and a wealth of other helpful tips, strategies, and ideas. Included are extensive lists of media contacts and useful resources. 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
Data Mining: Technologies, Techniques, Tools, and Trends
Authors: Bhavani Thuraisingham
Venue:  (1998)

:Focusing on a data-centric perspective, this book provides a complete overview of data mining: its uses, methods, current technologies, commercial products, and future challenges.. "Is there a need for mining? Do you have the right tools? Do you have the people to do the work? Do you have sufficient funds allocated to the project? All these questions must be answered before embarking on a project. Data Mining provides singular guidance on appropriate applications for specific techniques as well as thoroughly assesses valuable product information.
Helping users determine video quality of service settings
Authors: Ronald L. Boring, Robert L. West, Stephen Moore
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

In this paper, we present a method to assist users in selecting quality parameters for streaming video. Constrained scaling, a method for calibrating users' subjective judgements to a naturalistic scale is introduced. An experiment in which participants judged the fluidity of sample videos across different frame rates demonstrates the effectiveness of constrained scaling.
Upgrading and Fixing Networks for Dummies
Authors: Bill Camarda
Venue:  (1999)

:Want to supercharge your network's performance - without making yourself crazy? Upgrading & Fixing Networks for Dummies, 2nd Edition, makes it easy to sort through today's flashy new technologies and decide which ones you really need. Network expert Bill Camarada shows you the easy way to implement upgrades that actually make business sense. Weather you're nursing a sick LAN back to health, providing remote access to you telecommuters and salespeople, or adding a network fax, this handy guide shows you how to get the job done efficiently and easily.
Optimistic active messages: structuring systems for high-performance communication
Authors: M. Frans Kaashoek, William E. Weihl, Deborah A. Wallach, Wilson C. Hsieh, Kirk L. Johnson
Venue: Proceedings of the 6th workshop on ACM SIGOPS European workshop: Matching operating systems to application needs (1994)

Recent networks and network interfaces promise remarkable communication performance with very little overhead, but current software structures impose substantial overhead that prevents applications from achieving the benefits of these new architectures. We propose a new software structure that eliminates much of the overhead while preserving the ease of programming of current systems. Our architecture relies on the compiler to bridge the gap between high-level application programs and low-level communication primitives. The compiler incorporates application code into message handlers using a new runtime mechanism called optimistic active messages.
The distributed boosting algorithm
Authors: Aleksandar Lazarevic, Zoran Obradovic
Venue: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining (2001)

In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneous databases that cannot be merged at a single location. Our distributed boosting algorithm can also be used as a parallel classification technique, where a massive database that cannot fit into main computer memory is partitioned into disjoint subsets for a more efficient analysis. In the proposed method, at each boosting round the classifiers are first learned from disjoint datasets and then exchanged amongst the sites. Finally the classifiers are combined into a weighted voting ensemble on each disjoint data set. The ensemble that is applied to an unseen test set represents an ensemble of ensembles built on all distributed sites. In experiments performed on four large data sets the proposed distributed boosting method achieved classification accuracy comparable or even slightly better than the standard boosting algorithm while requiring less memory and less computational time. In addition, the communication overhead of the distributed boosting algorithm is very small making it a viable alternative to the standard boosting for large-scale databases.
Sams Teach Yourself Data Structures and Algorithms in 24 Hours with Cdrom, 1st edition
Authors: Robert Lafore
Venue:  (1999)

:Sams Teach Yourself Data Structures and Algorithms in 24 Hours presents data structures and algorithms in an easy-to-read, easy-to-understand style, allowing you to grasp the concepts quickly and apply the knowledge to your programs. The very popular C++ programming language is used for examples and code samples.
Efficient and robust feature extraction and pattern matching of time series by a lattice structure
Authors: Polly Wan Po Man, Man Hon Wong
Venue: Proceedings of the tenth international conference on Information and knowledge management (2001)

The efficiency of searching scaling-invariant and shifting-invariant shapes in a set of massive time series data can be improved if searching is performed on an approximated sequence which involves less data but contains all the significant features. However, commonly used smoothing techniques, such as moving averages and best-fitting polylines, usually miss important peaks and troughs and deform the time series. In addition, these techniques are not robust, as they often requires users to supply a set of smoothing parameters which has direct effect on the resultant approximation pattern. To address these problems, an algorithm to construct a lattice structure as an underlying framework for pattern matching is proposed in this paper. As inputs, the algorithm takes a time series and users' requirements of level of detail. The algorithm then identifies all the important peaks and troughs (known as controlm points) in the time series and classifies the points into appropriate layers of the lattice structure. The control points in each layer of the structure form an approximation pattern an yet preserve the overall shape of the original series with approximation error lies within certain bound. The lower the layer, the more precise the approximation pattern is. Putting in another way, the algorithm takes different levels of data smoothing into account. Also, the lattice structure can be indexed to further improve the performance of pattern matching.
A process cache memory for tightly coupled multiprocessor systems
Authors: Cosimo Antonio Prete
Venue: Proceedings of the 30th annual Southeast regional conference (1992)

Analysis of the simulation outputs and of the behaviour of some prototypes of shared-bus multiprocessors with cache memories showed that: (i) system performance depends on the percentage of write operations operating on shared copies and (ii) some events (such as process migration, execution of input/output interrupt routines on different processors, and so on) create a high number of shared copies derived from memory blocks belonging to private data of processes. Starting from these results, we have designed a new coherence protocol which works to reduce the number of shared copies. The basic new idea lies in (i) identifying the copies unused by the running process and (ii) destroying them when they are involved in shared-bus transactions. This paper describes this idea, the coherence protocol, the cache architecture requirements needed to realize such an idea.
Using the Internet with Your MAC with Disk
Authors: Todd Stauffer
Venue:  (1995)

:With an estimated 5 - 11 million Macintosh users on the Internet today, there is a clear demand for this user-friendly guide to all the basics! Covering only the essential information, this book will help users access the Internet and start surfing immediately!Covers choosing a service provider, sending and receiving email, creating your own Web pages, cool Web sites, chatting on the Net, and moreFocuses on the needs of the casual Mac userDisk includes MacTCP (a $50 value!), Eudora Light, Anarchie, and more
Dictionary of Computing, 4th edition
Authors: Valerie Illingworth
Venue:  (1997)

:The first edition of the Dictionary of Computing received worldwide acclaim when it was first published in 1983. This fourth edition, extensively revised by a team of computer specialists, should prove invaluable to students and teachers of computing as well as computer users in general. There are now some 6000 entries (1700 more than the third edition), with a comprehensive cross-reference system. The wide range of topics covered includes: computer applications in industry, the office, science, education, and the home; the means of achieving these applications - hardware, software, computer organization, telecommunications, and user interaction; security, safety, and legal aspects; underlying concepts and theories in computing and associated fields; and major computer manufacturers and organizations. The entries have been written by practitioners in all branches of computing and associated fields under the scrutiny of distinguished scholars from both sides of the Atlantic. Instructive diagrams and tables supplement the text where appropriate.