ppxscal/embedding_network huggingface dataset:
Introducing Desktop PrePress, 1st edition
Authors: Tim Meehan
Venue:  (1995)

:Introducing Desktop PrePress is the ultimate reference guide for creating camera-ready layouts for reproduction. Whether youre a desktop publishing novice or service bureau operator, users at every level of expertise benefit from the books practical tips and advice. The author gives detailed instruction for avoiding pre-press problems and working with printers and service bureaus. Introducing Desktop PrePress also includes coverage of specific programs like QuarkXPress, Adobe Photoshop, and PageMaker. 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
sub-SAT: a formulation for relaxed boolean satisfiability with applications in routing
Authors: Hui Xu, Rob A. Rutenbar, Karem Sakallah
Venue: Proceedings of the 2002 international symposium on Physical design (2002)

Advances in methods for solving Boolean satisfiability (SAT) for large problems have motivated recent attempts to recast physical de¿sign problems as Boolean SAT problems. One persistent criticism of these approaches is their inability to supply partial solutions, i.e, to satisfy most but not all of the constraints cast in the SAT style. In this paper we present a formulation for "subset satisfiable" Boolean SAT: we transform a "strict" SAT problem with N constraints into a new, "relaxed" SAT problem which is satisfiable just if not more than k < < N of these constraints cannot be satisfied in the original problem. We describe a transformation based on explicit thresholding and counting for the necessary SAT relaxation. Examples from FPGA routing show how we can determine efficiently when we can satisfy "almost all" of our geometric constraints.
Novell's Guide to Integrating UNIX and NetWare Networks
Authors: James E. Gaskin
Venue:  (1993)

:Novell's Guide to Integrating UNIX and NetWare Networks offers practical, timely coverage of the many issues surrounding NetWare-UNIX connectivity. Written especially for NetWare and UNIX administrators, MIS managers and buyers, this book provides a goldmine of choices, options, and shortcuts to simplify the integration process. Become a terminal emulation expert. Look for far-reaching coverage of everything, including Telnet from NetWare clients, third party TCP/IP gateways, both in and out of the NetWare server, and DOS and Windows terminal emulation programs. Explore file transfer options and NF5 interaction. Find out how to transfer files from NetWare clients to UNIX hosts and vice versa, and share data with UNIX NFS (Network File System) and NetWare NFS Gateway. Know your printing possibilities. Learn the various ways to print from NetWare to UNIX, or from UNIX to NetWare. Take advantage of cross-platform applications. You'll save time and money when you select packages that run under both NetWare and UNIX. Topics include e-mail, SQL databases, desktop applications, and more. You'll also find a buyer's guide to every product mentioned in the book, a command translation chart, and a valuable glossary of terms.
Making, Breaking Codes: Introduction to Cryptology, 1st edition
Authors: Paul B. Garrett
Venue:  (2000)

:This unique book explains the basic issues of classical and modern cryptography, and provides a self contained essential mathematical background in number theory, abstract algebra, and probabilitywith surveys of relevant parts of complexity theory and other things. A user-friendly, down-to-earth tone presents concretely motivated introductions to these topics. More detailed chapter topics include simple ciphers; applying ideas from probability; substitutions, transpositions, permutations; modern symmetric ciphers; the integers; prime numbers; powers and roots modulo primes; powers and roots for composite moduli; weakly multiplicative functions; quadratic symbols, quadratic reciprocity; pseudoprimes; groups; sketches of protocols; rings, fields, polynomials; cyclotomic polynomials, primitive roots; pseudo-random number generators; proofs concerning pseudoprimality; factorization attacks finite fields; and elliptic curves. For personnel in computer security, system administration, and information systems.
Beyond ASIS: program data bases and tool-oriented queries
Authors: Janusz Laski, William Stanley, Pawel Podgorski
Venue: Proceedings of the 2001 annual ACM SIGAda international conference on Ada (2001)

The availability of higher level ASIS libraries is of prime importance for the real success of ASIS technology to facilitate the development of Software Analysis and Testing (SAT) tools. This is due to the fact that ASIS queries are expressed in terms of the syntax of an immensely complex language and do not directly support the objectives of a tool builder. In this paper we discuss two plausible sets of higher levels, tool-oriented queries about the Program Under Analysis (PUA), which ideally do not require the knowledge of ASIS. We first present our experience with using ASIS to develop the front end of SWAT (SoftWare Analysis and Testing), a comprehensive system for static and dynamic (execution-based) software analysis. In it, ASIS is used to retrieve the information about the PUA and store it in Program Data Bases (PDBs). Then, an SAT tool uses the PDBs rather than ASIS to get the necessary information about the PUA. We hypothesize that the access functions to the PDBs can be viewed as second-level queries about the PUA; if well thought-out, a claim not made here, those queries can be used to build a wide class of program browsers. If, however, a more complicated tool is needed, a third level of queries can be specified. We illustrate that possibility by briefly showing how SEER, SWAT's dependency analyzer, uses several PDBs to carry out the dependency analysis whose results are stored in the derived PDBs; they are produced by processing the data in the original, primary PDBs. Again, the relations stored in the secondary PDBs gives rise to the third level queries about the PUA. It is obvious that higher level queries neither have to be implemented by an underlying ASIS layer nor the PDBs have to be used for that purpose. The main motivation here was to do that analysis without a direct use of ASIS. Indeed, we stress the importance of research into various SAT tools that would provide guidance in the definition of an "optimal" query language. In particular, we emphasize the need for ASIS queries that support dynamic, execution-based program analysis.
Making complex document structures accessible through templates
Authors: Felix H. Gatzemeier, Oliver Meyer
Venue: Proceedings of IEEE professional communication society international professional communication conference and Proceedings of the 18th annual ACM international conference on Computer documentation: technology & teamwork (2000)

We address two problems of technical authors in structured environments: (1) Structure definitions of the SGML school are limiting: they require one primary hierarchy and do not cater for link types and (2) Real-life structure definitions are too large to be comprehended easily. As solutions, we propose graph types and usage templates.The edge types and inheritance of the proposed graph type model are useful modeling tools. We give examples for structures that can be expressed more precisely and with gain for the author using graph structures. There are also graphical tools available to define graph types and to specify operations on graphs.Templates can be used as a simple parameterization mechanism. A template illustrates the usual usage of a substructure, as opposed to the minimal one required by a structure definition, or the maximal one allowed by it.We also present a prototype authoring application based on these ideas.
The B Language and Method: A Guide to Practical Formal Development, 1st edition
Authors: Kevin Lano
Venue:  (1996)

:B is a formal approach to software specification and development based on the Z specification language. It has been successfully applied in industry, and has robust, commercially available tool support for the entire development lifecycle, from specification through to code generation. The B Language and Method provides a comprehensive introduction to the B Abstract Machine Notation, and how it can be used to support formal specification and development of high integrity systems. Beginning with a discussion of the history of B, it builds up a description of the notation from the basic mathematical notation for sets and sequences, through to the structuring mechanisms of the language, and how it supports "programming in the large". Particular emphasis is placed on the use of B in the context of existing software development methods, including object-oriented analysis and design. Specifically designed to support the teaching of B at undergraduate and postgraduate level, the text includes a large number of worked examples and graduated exercises in B AMN specification. It also includes two extended case studies of the development process, and an appendix of proof techniques suitable for B.
Creating a Web community chart for navigating related communities
Authors: Masashi Toyoda, Masaru Kitsuregawa
Venue: Proceedings of the 12th ACM conference on Hypertext and Hypermedia (2001)

Recent research on link analysis has shown the existence of numerous web communities on the Web. A web community is a collection of web pages created by individuals or any kind of associations that have a common interest on a specific topic. In this paper, we propose a technique to create a web community chart, that connects related web communities, from thousands of seed pages. This allows the user to navigate through related web communities, and can be used for a `What's Related Community' service that provides not only the web community including a given page but also related web communities. Our technique is based on a related page algorithm that gives related pages to a given page using only link analysis. We show that the algorithm can be used for creating the chart by applying the algorithm to each seed, then using similarities of the results to classify seeds into clusters and to deduce their relationships. We perform experiments to create a web community chart of companies and organizations from thousands of seed pages. First, we improve the precision of an existing related page algorithm, Companion, and evaluated the improved version, Companion-, by an user study. Then the chart is created using Companion-. The result chart consists of web communities including related pages, and paths between related web communities. From the chart, we can find many web communities of companies classified by their category of business, and relationships between the communities.
Operating system level support for coherence in distributed systems
Authors: Mike Livesey, Colin Allison
Venue: Proceedings of the 5th workshop on ACM SIGOPS European workshop: Models and paradigms for distributed systems structuring (1992)

Distributed system builders are faced with the task of meeting a variety of requirements on the global behaviour of the target system, such as stability, fault-tolerance and failure recovery, concurrency control, commitment, and consistency of replicated data. The subset of these requirements relevant to a particular application we call its coherence constraint. The coherence constraint may be very difficult to enforce.Existing operating system services do not provide the system builder with an adequate platform for addressing coherence, although some systems address other aspects of coherence; for example, Isis [3] addresses the fault-tolerance issue. Even recent developments in micro-kernels such as Mach 3.0 [4] and Chorus [18], which have concentrated on supporting the shared-memory abstraction, still leave the systems builder to bridge a significant gap between OS services and basic coherence requirements. The variety of coherence requirements has given rise to a welter of mechanisms having a familial resemblance yet lacking real conceptual integration [16,17,20]. Consequently, the distributed application programmer treats each requirement in isolation, often resulting in costly solutions which are nevertheless obscure and idiosyncratic.Such problems have been observed in the context of object-based programming environments such as Argus [13], Clouds [7] and others [6]. They are confirmed by our own experience with a persistent object store transaction mechanism using NFS-oriented file locking [5,15].This paper describes an approach to distributed coherence enforcement based upon rollback. The approach is optimistic in the sense that violations of coherence are resolved rather than prevented---rollback is the agent of this resolution.Support for coherence is provided by units of distributed computation called transactions. This transaction mechanism is highly controllable, being designed to support advanced database requirements, involving "non-atomic" transactions, as well as conventional atomic transactions (c.f [19]). The transaction service is underpinned by rollback to provide the synchronisation, supported in turn by stable checkpointing and an integrated IPC protocol.The approach raises two key issues. The first is the problem of disseminating rollback properly through a distributed system. The second arises because computational progress does not occur monotonically in physical time but along its own virtual time axis, and concerns the interaction of these two time axes.
Control Systems, 2nd edition
Authors: Naresh K. Sinha
Venue:  (1994)

:This completely revised and updated work describes the basic concepts of control theory in both frequency and time domains. A discussion of classical material is followed by a thorough treatment of state-of-the-art knowledge. Contains an extensive number of realistic and challenging problems, with special emphasis on design, which enables readers to develop skills for practice. Executable computer programs are designed so that readers can grasp concepts and applications without getting caught up in mathematical drudgery.
PostScript by Example
Authors: Henry McGilton
Venue:  (1993)

:PostScript by Example is packed with 500 examples and 700 pictures to help users and programmers at all levels become knowledgeable in PostScript--the industry-standard page-description lanague developed by Adobe Systems Inc. Loaded with hands-on exercises and step-by-step instructions, this book covers two broad areas. You will start with the basic concepts of PostScript--graphics, text, and language. Then continue with "build-it-yourself" PostScript tools to construct fonts, patterns, forms, and manage your printing environment. Henry McGilton and Mary Campione provide invaluable information for both beginning and experienced PostScript users on how to: Law foundatinos of the PostScript painting model--paths, graphics states, text, clipping, transformations, arcs, curves and images. Understand PostScript Level 2 patterns, forms, images, composite fonts, halftones, and color models. Construct error handlers, download fonts and PostScript programs, and understand Encapsulated PostScript. The most comprehensive hands-on PostScript guide ever, PostScript by Example is your toolkit for building effective PostScript programs.
Introduction to Desktop Publishing, 1st edition
Authors: Robin B. McAllister
Venue:  (1996)

:This book introduces the student to the fundamentals, benefits, and pitfalls of desktop publishing. This approach challenges the observation that publishing from the desktop has been promoted to be easy, and the solution to all publishing problems. Topics include efficiency, type, color handling, high-resolution imaging, legal and ethical considerations, and more. By reviewing the evolution from standards of artistry and productivity to control, immediacy and price, it provides a foundation from which a student can build publishing expertise. 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 Fourth Discontinuity: The Co-Evolution of Humans and Machines, 1st edition
Authors: Bruce Mazlish
Venue:  (1995)

:This engrossing and lively book draws on history and legend, science and science fiction to consider the complex relationship between humans and machines. Bruce Mazlish argues that just as Copernicus, Darwin, and Freud overturned our illusions of separation from and domination over the cosmos, the animal world, and the unconscious, it is now necessary to relinquish a fourth fallacy or discontinuity-that humans are separate from the machines we make.
Computer Ethics, 3rd edition
Authors: Deborah G. Johnson
Venue:  (2000)

:Author Deborah G. Johnson has updated material throughout this text. Two new chapters on the Internet have been added: one focuses on ethical behavior online, and the other addresses the social implications of the Internet. Topics covered include: What is computer ethics? What are the philosophical foundations of computer ethics? How does computer ethics relate to professional ethics? Privacy. Property rights. Accountability. All topics are presented in compelling and understandable language, so that rigorous, in-depth analysis is accessible to students who may be novices in philosophy or technology studies.
ATM: Solutions for Enterprise Internetworking, 2nd edition
Authors: David Ginsburg
Venue:  (1999)

:David Ginsburg's book is a practical guide to ATM implementation, focusing strongly on how to integrate ATM within your existing enterprise network. It addresses the practical aspects of ATM: how to deploy ATM in support of data, voice and video traffic; how to support applications and services across the ATM network; which standards are relevant and what is their status; and which devices should be deployed for any given application environment. All of these solutions are backed up by extensive implementation scenarios, covering hardware, topologies, configurations, data models, and application support.
Computation offloading to save energy on handheld devices: a partition scheme
Authors: Zhiyuan Li, Cheng Wang, Rong Xu
Venue: Proceedings of the 2001 international conference on Compilers, architecture, and synthesis for embedded systems (2001)

We consider handheld computing devices which are connected to a server (or a powerful desktop machine) via a wireless LAN. On such devices, it is often possible to save the energy on the handheld by offloading its computation to the server. In this work, based on profiling information on computation time and data sharing at the level of procedure calls, we construct a cost graph for a given application program. We then apply a partition scheme to statically divide the program into server tasks and client tasks such that the energy consumed by the program is minimized. Experiments are performed on a suite of multimedia benchmarks. Results show considerable energy saving for several programs through offloading.
Then MacIntosh Bible Guide to FileMaker Pro 3, 3rd edition
Authors: Charles Rubin
Venue:  (1995)

:FileMaker Pro, the most popular database program for the Macintosh, is now one of the few cross-platform, relational databases that's also easy to use. Whether you're just getting started with FileMaker Pro, or you need to learn how to take advantage of the new robust features, this book's got you covered. You'll learn about creating files and defining fields, arranging information in layouts, finding information, sorting records, and designing reports. You'll also learn about FileMaker Pro's powerful new features such as relational database management capabilities, larger data-handling capacities, improved word processor-style formatting controls, dozens of new functions, and improved ScriptMaker. Written in a clear, non-nonsense style, this book shows how to get the most out of FileMaker Pro 3. Skipping tedious and repetitive explanations, it gets rights to the information you need.
Astronomy on the Web: A Brief Guide to the Internet, 2nd edition
Authors: Daniel J. Kurland
Venue:  (1998)

:This handy guide teaches students how to gather the latest astronomy updates on the Internet and complements the Brooks/Cole Astronomy Resource Center web site. It is divided into two sections: the first section provides the basics of getting access to and doing searches on the Internet, and the second lists useful Web sites in the field of astronomy.
A Practical Introduction to Data Structures and Algorithm Analysis, 2nd edition
Authors: Clifford A. Shaffer
Venue:  (2000)

:Clifford A. Shaffer provides a treatment of fundamental data structures and the principles of algorithm analysis understandable by sophomore and junior level students in Computer Science and related fields. The author focuses on teaching students and practitioners to understand the principles required to select or design the data structure that will best solve his/her problem.
A hybrid motion prediction method for caching and prefetching in distributed virtual environments
Authors: Addison Chan, Rynson W. H. Lau, Beatrice Ng
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2001)

Although there are a few methods proposed for predicting 3D motion, most of these methods are primarily designed for predicting the motion of specific objects, by assuming certain object motion behaviors. We notice that in desktop distributed 3D applications, such as virtual walkthrough and computer games, the 2D mouse is still the most popular device being used as navigation input. Through studying the motion behavior of a mouse during 3D navigation, we propose a hybrid motion model for predicting the mouse motion during a 3D walkthrough. At low motion velocity, we use a linear model for prediction and at high motion velocity, we use an elliptic model for prediction. We describe how this prediction method can be integrated into our distributed virtual environment for object model caching and prefetching. We also demonstrate the effectiveness of the prediction method and the resulting caching and prefetching mechanisms through extensive experiments.
SQL: A Beginner's Guide
Authors: Forrest Houlette
Venue:  (2000)

:Essential Skills for First-Time Programmers! SQL: A Beginner's Guide explains the fundamentals of SQL programming. You'll learn to access a database and retrieve,insert,and delete data,build and deploy stored procedures,and combine views and subqueries to select and update data. Learn the basics of Structured Query Language programming from the tutorials and examples in this easy-to-follow resource. SQL: A Beginner's Guide teaches you how to use SQL to work with data in a database,develop database objects,create subqueries,build views,write stored procedures,and accomplish complex selects and updates. The examples throughout the book walk you through real-world database tasks. If you want to get started programming in SQL right away,this is the ideal self-paced learning tool for you. This Beginner's Guide is Designed for Easy Learning:Modules - Each programming concept is divided into logical modules (chapters),ideal for individualized learningGoals - Each module opens with the specific programming skills you'll have by the end of the moduleAsk the Experts - Q&A sections throughout are filled with extra information and interesting commentary1-Minute Drills - Quick self-assessment sections to check your progressAnnotated Syntax - Example code annotated with commentary that points to the particular technique illustratedProjects - Coding exercises contained in each module show how to apply what you are learningMastery Checks - End-of-module reviews that test your knowledge using short-answer,multiple-choice,fill-in-the-blank,and simple coding questions