ppxscal/embedding_network huggingface dataset:
Lessons learned: implementing a desktop replacement program
Authors: Anne Lind, Steven Sather, Linwood Futrelle, Patrick Valiquette
Venue: Proceedings of the 29th annual ACM SIGUCCS conference on User services (2001)

Many universities have determined that a regular desktop computer replacement cycle helps to standardize systems, lower increasing support needs, and regularize the budget. There are a variety of implementations of these programs, from mandated "bulldoze" replacements to voluntary rolling installations.This panel will showcase several universities that have instituted a desktop replacement program. The Princeton Desktop Initiative came out of a funded mandate from the Provost's office and affected all faculty and staff systems. At the University of Virginia, an inter-departmental group implemented a voluntary program, the Desktop Computing Initiative, that included supplemental funding for some departments. The University of North Carolina at Chapel Hill instituted a life cycle replacement program for its College of Arts and Sciences. Every faculty, staff and teaching graduate student received a computer in a collaborative program as part of its Carolina Computer Initiative program. Rensselaer Polytechnic Institute's program requires students to have a laptop. Faculty are included in the program through an application process.The focus of this panel presentation will be on the implementation strategies these universities followed, including lessons learned.
Approximation schemes for preemptive weighted flow time
Authors: Chandra Chekuri, Sanjeev Khanna
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

(MATH) We present the first approximation schemes for minimizing weighted flow time on a single machine with preemption. Our first result is an algorithm that computes a (1+&egr;)-approximate solution for any instance of weighted flow time in O(nO(ln W ln P/&egr;3)) time; here P is the ratio of maximum job processing time to minimum job processing time, and W is the ratio of maximum job weight to minimum job weight. This result directly gives a quasi-PTAS for weighted flow time when P and W are poly-bounded, and a PTAS when they are both O(1). We strengthen the former result to show that in order to get a quasi- PTAS it suffices to have just one of P and W to be poly-bounded. Our result provides strong evidence to the hypothesis that the weighted flow time problem has a PTAS. We note that the problem is strongly NP-hard even when P and W are O(1). We next consider two important special cases of weighted flow time, namely, when P is O(1) and W is arbitrary, and when the weight of a job is inverse of its processing time referred to as the stretch metric. For both of the above special cases we obtain a (1+&egr;)-approximation for any &egr; &rho; 0 by using a randomized partitioning scheme to reduce an arbitrary instance to several instances all of which have P and W bounded by a constant that depends only on &egr;.
Cisco IOS Dial Solutions
Authors: CORPORATE Cisco Systems,  Inc.
Venue:  (1998)

:As the only Cisco-endorsed guide to configuring dial solutions from CiscoÆs perspective, Cisco IOS Dial Solutions offers the most current information on dial-up solutions to date. Containing hundreds of configuration scenarios and demonstrating how to implement specific dial solutions in corporate network environments, this guide is vital to network administrators. Learn real-world dial solutions and how to implement them. Take advantage of the remote access solutions, as well as WAN dial-up solutions. Work more efficiently with the knowledge of CiscoÆs cost-control solutions. In addition, learn the latest in dial and communication protocols for both Enterprise and Service Provider network environments. From dial-in port setup to dial-related addressing services, this reference ensures your success while working with dial solutions.
Judgement of information quality and cognitive authority in the Web
Authors: Soo Young Rieh
Venue: Journal of the American Society for Information Science and Technology (2002)

In the Web, making judgments of information quality and authority is a difficult task for most users because overall, there is no quality control mechanism. This study examines the problem of the judgment of information quality and cognitive authority by observing people's searching behavior in the Web. Its purpose is to understand the various factors that influence people's judgment of quality and authority in the Web, and the effects of those judgments on selection behaviors. Fifteen scholars from diverse disciplines participated, and data were collected combining verbal protocols during the searches, search logs, and postsearch interviews. It was found that the subjects made two distinct kinds of judgment: predictive judgment, and evaluative judgment. The factors influencing each judgment of quality and authority were identified in terms of characteristics of information objects, characteristics of sources, knowledge, situation, ranking in search output, and general assumption. Implications for Web design that will effectively support people's judgments of quality and authority are also discussed.
Principles of Three-Dimensional Computer Animation: Modeling, Rendering, and Animating with 3d Computer Graphics, 2nd edition
Authors: Michael O'Rourke
Venue:  (1998)

:If you work with or wish to use 3D computer animation, or want to gain a thorough and systematic understanding of computer animation - even if you have no prior knowledge of computers, computer graphics, mathematics, or programming - Principles of Three-Dimensional Computer Animation is for you. It explains, in terms laymen can understand, the general principles that underlie all 3D computer animation systems, without recourse to mathematical equations or programming code. This book is not a software manual. It does not deal with the specific implementation of the principles of three-dimensional computer animation by any one software package. Rather, it provides a thorough understanding of the basic concepts and techniques - modeling, rendering, animating, and recording to film and video - on which computer animation is based. With this knowledge in hand, you can quickly learn the operation of specific software packages. In addition to the fundamentals, the book covers advanced animation techniques and compositing and special effects, all of them found in commercially available software packages. Whether you are a beginning student of computer graphics or a professional involved in projects that involve 3D computer animation, you will find the information you need presented in a clear and readable style, illustrated with hundreds of drawings, diagrams, and renderings.
Learning and Practicing Econometrics: SAS Handbook, 1st edition
Authors: R. Carter Hill
Venue:  (1993)

:Designed to promote students' understanding of econometrics and to build a more operational knowledge of economics through a meaningful combination of words, symbols and ideas. Each chapter commences in the way economists begin new empirical projects--with a question and an economic model--then proceeds to develop a statistical model, select an estimator and outline inference procedures. Contains a copious amount of problems, experimental exercises and case studies.
The living memory box: function, form and user centered design
Authors: Molly Stevens, Florian Vollmer, Gregory D. Abowd
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

The Living Memory Box project examines how to research and design user-centered system to support the collection, archiving and sharing of moments from a child's life. This research has provided us with details of key features to enhance our user-centered design and encompass all aspects of the system. We plan to use these findings to influence the development of ubiquitous capture and access methods. It is our contention that this method of desing can yield a strong foundation for the development of user-centered design throughout all aspects of the system.
Safetynet
Authors: Zachary Britton
Venue:  (1998)

:Who's minding the Internet? Every stranger in the world has access to your child, right in your own home. How do you protect the people you love? SafetyNet gives you user-friendly guidelines for guarding your child's online adventures. 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
Engineering Documentation Control Practices and Procedures
Authors: Ray E. Monahan
Venue:  (1995)

:This practical reference discusses the requirements for establishing, maintaining, and revitalizing an efficient engineering documentation control system for use by technical and manufacturing personnel in private industry - stressing simplicity and common sense in the development and implementation of all control practices, procedures, and forms. Emphasizing the control of both hardware and software products, Engineering Documentation Control Practices and Procedures describes how configuration management encompasses engineering documentation control ... details the importance of a configuration identification system that uses a minimum number of identifiers ... covers record-keeping techniques necessary to insure that as-built and as-shipped product configurations are identical to as-designed product specifications ... elucidates a fast and accurate system of change processing ... investigates the transition from a manual to an automated engineering documentation system ... furnishes a list of effective interchangeability rules, a glossary of essential engineering documentation terms, and an extensive bibliography of key literature sources ... and more. Engineering Documentation Control Practices and Procedures is an invaluable resource for mechanical, computer, design, manufacturing, and civil engineers; program, purchasing, and documentation and production control managers; and upper-level undergraduate, graduate, and continuing-education students in these disciplines. 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
Systematic design of program transformation frameworks by abstract interpretation
Authors: Patrick Cousot, Radhia Cousot
Venue: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2002)

We introduce a general uniform language-independent framework for designing online and offline source-to-source program transformations by abstract interpretation of program semantics. Iterative source-to-source program transformations are designed constructively by composition of source-to-semantics, semantics-to-transformed semantics and semantics-to-source abstractions applied to fixpoint trace semantics. The correctness of the transformations is expressed through observational and performance abstractions. The framework is illustrated on three examples: constant propagation, program specialization by online and offline partial evaluation and static program monitoring.
A study of cursor trajectories of motion-impaired users
Authors: Faustina Hwang
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

This paper describes a study of the cursor trajectories of motion-impaired users in "point and click" interactions. A characteristic of cursor movement is proposed that aims to capture the spatial distribution of cursor movement about a target. This characteristic indicates that users often exhibit increased cursor movement in the vicinity of the target, have more difficulty performing the "clicking" part of the interaction as compared to the navigation part, and tend to navigate directly toward the target during the middle portion of the cursor trajectory. The implications of these characteristic behaviours on interface design are discussed.
Discovery of ontologies from knowledge bases
Authors: Hendra Suryanto, Paul Compton
Venue: Proceedings of the 1st international conference on Knowledge capture (2001)

Current approaches to building knowledge-based systems propose the development of an ontology as a precursor to building the problem-solver. This paper outlines an attempt to do the reverse and discover interesting ontologies from systems built without the ontology being explicit. In particular the paper considers large classification knowledge bases used for the interpretation of medical chemical pathology results and built using Ripple-Down Rules (RDR). The rule conclusions in these knowledge bases provide free-text interpretations of the results rather than explicit classes. The goal is to discover implicit ontological relationships between these interpretations as the system evolves. RDR allows for incremental development and the goal is that the ontology emerges as the system evolves. The results suggest that approach has potential, but further investigation is required before strong claims can be made.
Intersection types for λ-trees
Authors: Steffan van Bakel, Franco Barbanera, Mariangiola Dezani-Diancaglini, Fer-Jan de Vries
Venue: Theoretical Computer Science (2002)

We introduce a type assignment system which is parametric with respect to five families of trees obtained by evaluating &lambda;-terms (Bhm trees, Lvy-Longo trees, etc.). Then we prove, in an (almost) uniform way, that each type assignment system fully describes the observational equivalences induced by the corresponding tree representation of &lambda;-terms. More precisely, for each family of trees, two &lambda;-terms have the same tree if and only if they get assigned the same types in the corresponding type assignment system. Copyright 2002, Elsevier Science B.V.
Adobe PhotoShop Master Class
Authors: John Paul Caponigro
Venue:  (2000)

:The personal vision of internationally recognized fine-art photographer John Paul Caponigro serves for the focal point of this book. Readers gain insight into Caponigro's creative process and learn how Photoshop can help them develop their own aesthetic and craft. By showcasing his work and carefully explaining the steps he took to produce it, the author provides insight into both his creative method and his Photoshop techniques. Each chapter in this elegantly designed, four-color book is organized around a specific visual theme (atmospheric perspective, selective focus, and split-toned or subdued-color images, for example). Chapters begin with an introduction to the visual concept followed by a step-by-step illustration of the process leading to its realization. This book is a visual treat and an inspiration. 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
User adaptive content delivery mechanism on the world wide web
Authors: Tadashi Nakano, Kaname Harumoto, Shinji Shimojo, Shojiro Nishio
Venue: Proceedings of the 2002 ACM symposium on Applied computing (2002)

To reduce the user-perceived latency in web content delivery, many techniques have been proposed. One is a transmission time control mechanism that automatically adjusts the quality of inline objects, such as images on a web page, according to the client network bandwidth. Another is a transmission order control mechanism that can transmit inline objects in a specified order preferred by users. In this paper, we describe the development of a user adaptive content delivery mechanism that integrates transmission time control and transmission order control. Based on the user's preference profile, it dynamically prioritizes inline objects in terms of content quality and delivery order, and provides user with adapted inline objects. A prototype system has been implemented in Java, and gives an example of adapted content delivery.
Static and Dynamic Locality Optimizations Using Integer Linear Programming
Authors: Mahmut Kandemir, Prithviraj Banerjee, Alok Choudhary, J. Ramanujam, Eduard Ayguadé
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

The delivered performance on modern processors that employ deep memory hierarchies is closely related to the performance of the memory subsystem. Compiler optimizations aimed at improving cache locality are critical in realizing the performance potential of powerful processors. For scientific applications, several loop transformations have been shown to be useful in improving both temporal and spatial locality. Recently, there has been some work in the area of data layout optimizations, i.e., changing the memory layouts of multidimensional arrays from the language-defined default such as column-major storage in Fortran. The effect of such memory layout decisions is on the spatial locality characteristics of loop nests. While data layout transformations are not constrained by data dependences, they have no effect on temporal locality. On the other hand, loop transformations are not readily applicable to imperfect loop nests and are constrained by data dependences. More importantly, loop transformations affect the memory access patterns of all the arrays accessed in a loop nest and, as a result, the locality characteristics of some of the arrays may worsen. This paper presents a technique based on integer linear programming (ILP) that attempts to derive the best combination of loop and data layout transformations. Prior attempts to unify loop and data layout transformations for programs consisting of a sequence of loop nests have been based on heuristics not only for transformations for a single loop nest but also for the sequence in which loop nests will be considered. The ILP formulation presented here obviates the need for such heuristics and gives us a bar against which the heuristic algorithms can be compared. More importantly, our approach is able to transform memory layouts dynamically during program execution. This is particularly useful in applications whose disjoint code segments demand different layouts for a given array. In addition, we show how this formulation can be extended to address the false sharing problem in a multiprocessor environment. The key data structure we introduce is the memory layout graph (MLG) that allows us to formulate the problems as path problems. The paper discusses the relationship of this ILP approach based on the memory layout graphs to other work in the area including our previous work. Experimental results on a MIPS R10000-based system demonstrate the benefits of this approach and show that the use of the ILP formulation does not increase the compilation time significantly.
Error-tolerant password recovery
Authors: Niklas Frykholm, Ari Juels
Venue: Proceedings of the 8th ACM conference on Computer and Communications Security (2001)

Many encryption systems require the user to memorize high entropy passwords or passphrases and reproduce them exactly. This is often a difficult task. We propose a more fault-tolerant scheme, where a high entropy key (or password) is derived from a sequence of low entropy passwords. The user is able to recover the correct key if she remembers a certain percentage of the passwords correctly. In contrast to other systems that have been proposed for fault-tolerant passwords, our basic design is provably secure against a computationally unbounded attacker.
Generalized clustering, supervised learning, and data assignment
Authors: Annaka Kalton, Pat Langley, Kiri Wagstaff, Jungsoon Yoo
Venue: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining (2001)

Clustering algorithms have become increasingly important in handling and analyzing data. Considerable work has been done in devising effective but increasingly specific clustering algorithms. In contrast, we have developed a generalized framework that accommodates diverse clustering algorithms in a systematic way. This framework views clustering as a general process of iterative optimization that includes modules for supervised learning and instance assignment. The framework has also suggested several novel clustering methods. In this paper, we investigate experimentally the efficacy of these algorithms and test some hypotheses about the relation between such unsupervised techniques and the supervised methods embedded in them.
Computer Security Management, 1st edition
Authors: Karen A. Forcht
Venue:  (1994)

:Computer Security Management provides a broad overview of computer security and offers guidance for improving business systems, procedures, and the skills of personnel. Here are some highlights:. State-of-the-art coverage with an emphasis on future trends. Promotes the concept that an effective manager must always stay current on security matters. A comprehensive chapter on viruses and other forms of malicious code provides descriptive background and offers popular prevention and remedial options. Discusses legal aspects of computer security with an eye toward effective management. Stresses the principle that planning ahead of time is better than after-the-fact punishment or reorganization after the damage has been done. A chapter on computer ethics introduces this preventative aspect of computer security. Thorough coverage of planning for natural disasters. Details contingency plans to minimize effects of natural disasters and outlines rapid recovery techniques. Each chapter opens with a contemporary vignette that focuses on real business situations relevant to the material covered within the chapter. Problem-solving exercises and in-depth case studies are also offered.
Computer Graphics: An Object-Oriented Approach to the Art and Science Implemented in C++, 1st edition
Authors: Cornel K. Pokorny
Venue:  (1995)

:This book presents the principles behind the art and science of computer graphics within an object-oriented context. Included are examples of multiple algorithms for generating images and all C++ source codes on diskette.
The Computer from a to Z
Authors: Bobbie D. Kalman
Venue:  (1998)

:Each letter of the alphabet introduces a brief discussion of a word that has something to do with computers. 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
KDD Cup 2001 report
Authors: Jie Cheng, Christos Hatzis, Hisashi Hayashi, Mark-A. Krogel, Shinichi Morishita, David Page, Jun Sese
Venue: ACM SIGKDD Explorations Newsletter (2002)

This paper presents results and lessons from KDD Cup 2001. KDD Cup 2001 focused on mining biological databases. It involved three cutting-edge tasks related to drug design and genomics.
Using Javascript (Special Edition), 2nd edition
Authors: Andrew Wooldridge
Venue:  (1997)

:As the most popular scripting language on the Web and the only client scripting language currently supported by both Netscape and Internet Explorer, JavaScript is perfect for users who want to add life to their Web sites-but lack advanced programming skills. Special Edition Using JavaScript, Second Edition is the most comprehensive reference available on this incredible technology.Explores the new functions of JavaScript and it's usesShows how JavaScript, in conjunction with the LiveConnect model, can be used to interface with Java and plug-ins such as Shockwave and RealAudioCD-ROM includes JavaScript and Java examples from the book, Web helpers and utilities; additional code and examples not found in the book and an HTML listing of key JavaScript, Java, and Web programming sites on the Internet
A computer classification of psychiatric patients
Authors: Robert H. Flake, James H. Satterfield
Venue: Proceedings of the 6th annual Southeastern regional meeting of the Association for Computing Machinery and national meeting of Biomedical Computing - Volume 1 (1967)

A new numerical classification procedure and the results that were obtained when this procedure was applied to a group of psychiatric patients is discussed in this paper.