ppxscal/embedding_network huggingface dataset:
An infrastructure language for open nets
Authors: Lorenzo Bettini, Michele Loreti, Rosario Pugliese
Venue: Proceedings of the 2002 ACM symposium on Applied computing (2002)

The structure of open nets, like the Internet, is highly dynamic, as the topology of component networks continuously evolves. In this context, node connectivity is a key aspect and a language for distributed network-aware mobile applications should provide explicit mechanisms to handle it. In this paper, we address the problem of expressing dynamic changes of node connectivity at linguistic level and, in particular, we focus on a slight extension of the language KLAIM, that is targeted to this aim. The extension consists of the introduction of a new category of processes that, in addition to the standard process operations, can execute a few new coordination operations for establishing new connections, accepting connection requests and removing connections. Our extension puts forward a clean separation between the coordinator level and the user level and, hence, it is modular enough to be easily applicable also to other network-aware languages. We will also show that our approach can be used as a guide for actual distributed (i.e. without a single centralized server) implementations of mobile systems.
Reducing Memory Latency via Read-after-Read Memory Dependence Prediction
Authors: Andreas Moshovos, Gurindar S. Sohi
Venue: IEEE Transactions on Computers (2002)

We observe that typical programs exhibit highly regular read-after-read (RAR) memory dependence streams. To exploit this regularity, we introduce read-after-read (RAR) memory dependence prediction. This technique predicts whether: 1) A load will access a memory location that a preceding load accesses and 2) exactly which this preceding load is. This prediction is done without actual knowledge of the corresponding memory addresses. We also present two techniques that utilize RAR memory dependence prediction to reduce memory latency. In the first technique, a load may obtain a value by naming a preceding load with which an RAR dependence is predicted. The second technique speculatively converts a series of ${\rm LOAD}_1{\hbox{-}}{\rm USE}_1,\ldots,{\rm LOAD_N}{\hbox{-}}{\rm USE_N}$ chains into a single ${\rm LOAD}_1{\hbox{-}}{\rm USE}_1\ldots{\rm USE_N}$ producer/consumer graph. This is done whenever RAR dependences are predicted among the ${\rm LOAD_i}$ instructions. Our techniques can be implemented as small extensions to the previously proposed read-after-write (RAW) dependence prediction-based speculative memory cloaking and speculative memory bypassing. On average, our RAR-based techniques provide correct values for an additional 20 percent (integer codes) and 30 percent (floating-point codes) of all loads. Moreover, a combined RAW- and RAR-based cloaking/bypassing mechanism improves performance by 6.44 percent (integer) and 4.66 percent (floating-point) over a highly aggressive dynamically scheduled superscalar processor that uses naive memory dependence speculation. By comparison, the original RAW-based cloaking/bypassing mechanism yields improvements of 4.28 percent (integer) and 3.20 percent (floating-point). When no memory dependence speculation is used, our techniques yield speedups of 9.85 percent (integer) and 6.14 percent (floating-point).
Mixin layers: an object-oriented implementation technique for refinements and collaboration-based designs
Authors: Yannis Smaragdakis, Don Batory
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2002)

A "refinement" is a functionality addition to a software project that can affect multiple dispersed implementation entities (functions, classes, etc.). In this paper, we examine large-scale refinements in terms of a fundamental object-oriented technique called collaboration-based design. We explain how collaborations can be expressed in existing programming languages or can be supported with new language constructs (which we have implemented as extensions to the Java language). We present a specific expression of large-scale refinements called mixin layers, and demonstrate how it overcomes the scalability difficulties that plagued prior work. We also show how we used mixin layers as the primary implementation technique for building an extensible Java compiler, JTS.
Transitioning to Open Systems: Concepts, Methods, and Architecture
Authors: Steven L. Shaffer
Venue:  (1996)

:Organizations of all sizes have begun the process of transforming their legacy information systems into modern environments that take advantage of open information technologies. Emphasizing the important combination of technology and methodology, Steven Shaffer and Alan Simon help you determine a clear, realistic view of how open information technology should be deployed throughout your organization to ensure that costly, time-consuming efforts in this realm succeed. Their book examines open systems from a strategic, architecture-level perspective, focusing on the integration of networking, data management, business logic, user interface, and related types of open technology based services. Features: Emphasizes the combination of technology with rigorous procedures and methodology to ensure a successful transition. Provides a case study of a successful transition using the systematic approach and set of methods presented in the book.
Mastering AutoCAD R14
Authors: Ron K.C. Cheng
Venue:  (1999)

:Cheng's newest self-paced AutoCAD&reg; tutorial provides a practical step-by-step introduction to 3D computer-aided design drawing using AutoCAD&reg; Release 14. The latest version of AUTOCAD&reg;, RELEASE 14 is exclusively Windows-based (versus DOS/Windows), and has increased 3D capability. Cheng's guide reflects these latest changes, and also includes instruction on creating 3D solid objects. The book presents AutoCAD&reg; commands in the context of hands-on exercises that guide first-time users through entity creation, editing, and manipulation; creation of engineering drawings; preparation, dimensioning, and plotting of hard-copy documents. This book starts from basic - then gradually advances to more complicated - 3D components, using self-paced mini-projects in its illustration. A summary of all AutoCAD&reg; commands used in the exercises is found in the last chapter, making this book a useful working reference for professional engineers and designers.
The Ultimate Batch File Book
Authors: Ronny Richardson
Venue:  (1995)

:In this one-of-a-kind book/CD-ROM package, Ronny "Dr. Batch File" Richardson shows you how to harness the power of batch files under all the most popular operating systems: MS-DOS 6.2, PC DOS 6.3, Novell DOS 7, OS/2 Warp, and Windows. Richardson, today's leading writer on batch files, covers every aspect of writing keystroke-saving programs that can be used as they are or modified for virtually any file management chore. He unveils dozens of innovative batch file tricks and techniques you can use to make your work on the keyboard easier and more efficient.
In the outpost trenches: bridging physical gaps in customer service
Authors: Matt Alofs
Venue: Proceedings of the 29th annual ACM SIGUCCS conference on User services (2001)

This paper discusses challenges involved in providing customer service when the main group of service providers is distant from the customer, the limitations of phone support and the communication and cooperation.
Improving Performance of Large Physically Indexed Caches by Decoupling Memory Addresses from Cache Addresses
Authors: Rui Min, Yiming Hu
Venue: IEEE Transactions on Computers (2001)

Modern CPUs often use large physically indexed caches that are direct-mapped or have low associativities. Such caches do not interact well with virtual memory systems. An improperly placed physical page will end up in a wrong place in the cache, causing excessive conflicts with other cached pages. Page coloring has been proposed to reduce the conflict misses by carefully placing pages in the physical memory. While page coloring works well for some applications, many factors limit its performance. Page coloring limits the freedom of the page placement system and may increase swapping traffic. In this paper, we propose a novel and simple architecture, called color-indexed, physically tagged caches, which can significantly reduce the conflict misses. With some simple modifications to the TLB (Translation Look-aside Buffer), the new architecture decouples the addresses of the cache from the addresses of the main memory. Since the cache addresses do not depend on the the physical memory addresses anymore, the system can freely place data in any cache page to minimize the conflict misses, without affecting the paging system. Extensive trace-driven simulation results show that our design performs much better than traditional page coloring techniques. The new scheme enables a direct-mapped cache to achieve hit ratios very close to or better than those of a two-way set associative cache. Moreover, the architecture does not increase cache access latency, which is a drawback of set associative caches. The hardware overhead is minimal. We show that our scheme can reduce the cache size by 50 percent without sacrificing performance. A two-way set-associative cache that uses this strategy can perform very close to a fully associative cache.
Programming Microcontrollers in C, 1st edition
Authors: Ted Van Sickle
Venue:  (1994)

:Master the art and science of programming microcontrollers with this terrific new addition to Motorola's Series in Solid State Electronics. Ted Van Sickle shows you how to fully utilize the C language to exploit the power of today's advanced microcontrollers through extensive programming examples drawn from typical applications. In over 400 pages, Van Sickle... * shows you how programming in C on a microcontroller differs from programming in C on a microcomputer -- such as the relative scarcity of memory in microcontroller applications * describes techniques to get maximum performance from your code * discusses the essential differences between 'small' and 'large' 8-bit microcontrollers and the various C compilers available for microcontrollers
MAC OS 7.6 for Dummies, 2nd edition
Authors: Bob LeVitus
Venue:  (1997)

:Mac OS 7.6 For Dummies is the fun way to master the latest version of the Macintosh operating system. Whether you're brand new to the Macintosh environment or upgrading from older system software, best-selling author Bob LeVitus takes you on a friendly, informative tour of Mac OS 7.6 He explains how the features work in an easy-to-understand language so that you make the most of your time with your Mac. Inside, find helpful advice on how to Experience Cyberdog, OpenDoc, QuickTime 2.5, and all of the newest features of the system software Get your Mac up and running on the Internet in no time Tweak your control panel to customize the look and feel of Mac OS 7.6 Save RAM and hard disk space with Bob's guide to "What Can Stay and What Can Go" Manage your files and folders to keep your Mac neat and organized Automate your everyday tasks with a fun introduction to AppleScript Discover the techniques that the gurus use to squeeze every ounce of performance from their Macs Resolve extension and control panel conflicts with ease Master networking, file sharing, and printing Find out the difference between real and virtual memory
A Quick Course in Word 6 for Windows
Authors: Joyce Cox
Venue:  (1993)

:Focusing on Word 6 for Windows, this is one of a series of computer-training books for people with busy schedules.
The faithfulness of abstract protocol analysis: message authentication
Authors: Joshua D. Guttman, F. Javier Thayer, Lenore D. Zuck
Venue: Proceedings of the 8th ACM conference on Computer and Communications Security (2001)

Dolev and Yao initiated an approach to studying cryptographic protocols which abstracts from possible problems with the cryptography so as to focus on the structural aspects of the protocol. Recent work in this framework has developed easily applicable methods to determine many security properties of protocols. A separate line of work, initiated by Bellare and Rogaway, analyzes the way specific cryptographic primitives are used in protocols. It gives asymptotic bounds on the risk of failures of secrecy or authentication.In this paper we show how the Dolev-Yao model may be used for protocol analysis, while a further analysis gives a quantitative bound on the extent to which real cryptographic primitives may diverge from the idealized model. We develop this method where the cryptographic primitives are based on Carter-Wegman universal classes of hash functions. This choice allows us to give specific quantitative bounds rather than simply asymptotic bounds.
Microsoft Excel 97 for Windows 95, 1st edition
Authors: Patricia Murphy
Venue:  (1998)

:This book provides a complete learning package that makes e mastery of Excel '97 both easy and fun. Designed to get users up and running quickly, the book allows them to master Excel with a minimum of time and effort. With numerous screen illustrations and lots of hands-on activities for guidance, the reader learns quickly in a straightforward, understandable manner.
Introduction to Microprocessors
Authors: John Crisp
Venue:  (1998)

:If you are, or soon will be, involved in the use of microprocessors, this practical introduction is essential reading. This book provides a thoroughly readable introduction to microprocessors, assuming no previous knowledge of the subject, nor a technical or mathematical background. It is suitable for students, technicians, engineers and hobbyists, and covers the full range of modern microprocessors.* Textbook for a wide range of introductory courses in FE and HE * Strong practical bias will appeal to practitioners and trainees * Clear and comprehensible; not too much math! This book provides a thoroughly readable introduction to microprocessors, assuming no previous knowledge of the subject, or a technical or mathematical background. It is suitable for students, technicians, engineers and hobbyists, and covers the full range of modern microprocessors. All technical terms are carefully introduced and subjects that have proved difficult, for example 2's complement, are clearly explained. This book is for BTEC National and HNC/D, GNVQ, and City & Guilds 2710. About The AuthorJohn Crisp is an experienced lecturer in microprocessors, fiber-optics, mathematics and electronics. He has written several training manuals for use on the courses that he teaches.
The Principles of Computer Hardware, 2nd edition
Authors: Alan Clements
Venue:  (1992)

:Ideal for a course in computer hardware, architecture, or digital design in departments of computer science and engineering, The Principles of Computer Hardware, 3/E, provides a comprehensive introduction to the subject. In Alan Clements noted student-friendly style, this text covers both the 68000 and ARM architectures and in a tutorial or lab-based style suitable for a variety of courses. The third edition has been significantly improved with all chapters having been rigorously updated. Powerful new simultation software has been added which allows the student to visualize digital designs. The chapter on RISC has been completely rewritten to include the ARM computer. The tutorial based introduction to assembly language now includes many examples. Easy to read, student-friendly style. Comprehensive introduction to the subject. Covers two popular microprocessors (68000 and ARM). Tutorial or lab-based approach suitable for many courses.
Resolving semantic heterogeneity in schema integration
Authors: Farshad Hakimpour, Andreas Geppert
Venue: Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001 (2001)

Interoperability and integration of data sources are becoming ever more important issues as both, the amount of data and the number of data producers are growing. Interoperability not only has to resolve the differences in data structures, it also has to deal with semantic heterogeneity. Semantics refer to the meaning of data in contrast to syntax, which only defines the structure of the schema items (e.g., classes and attributes). We focus on the part of semantics related to the meanings of the terms used as identifiers in schema definitions. This paper presents an approach to integrate schemas from different communities, where each such community is using its own ontology. The approach is based on merging ontologies based on similarity relations among concepts of different ontologies. We present formal definitions of similarity relations based on intensional definitions and conclude the extensional consequences. The process of merging ontologies based on the detected similarity relations is discussed. The merged ontology is finally used to derive an integrated schema. The resulting schema can be used as the global schema in a federated database system.
Approximate clustering via core-sets
Authors: Mihai Bādoiu, Sariel Har-Peled, Piotr Indyk
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering efficiently. The surprising property of those core-sets is that their size is independent of the dimension.Using those, we present a (1+ &egr;)-approximation algorithms for the k-center clustering and k-median clustering problems in Euclidean space. The running time of the new algorithms has linear or near linear dependency on the number of points and the dimension, and exponential dependency on 1/&egr; and k. As such, our results are a substantial improvement over what was previously known.We also present some other clustering results including (1+ &egr;)-approximate 1-cylinder clustering, and k-center clustering with outliers.
Programmable Controllers, 2nd edition
Authors: Thomas A. Hughes
Venue:  (1997)

:Programmable Controllers has been used as both a textbook for Programmable Logic Controller courses and for self-study by thousands of professionals. This applications-based book provides a clear and concise presentation of the fundamental principles of programmable controllers for process and machine control. Hughes discusses all phases of programmable controller applications from design and programming to installation, maintenance, and start-up. He has increased the coverage of the five standard PLC programming languages: Ladder Diagram, Function Block Diagram, Sequential Function Chart, Statement List and Structured Text in this third edition and added numerous programming applications and examples to clearly explain each a programming language. The text provides a complete and comprehensive presentation on the design, programming, maintenance, and troubleshooting of several important control applications. The material also includes chapters on binary logic fundamentals, electrical and electronic principles, input and output systems, memory and addressing, programming languages, and data communication. The final chapter covers design, installation, and maintenance of programmable controller in detail. 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 system software structure for distributed multimedia systems
Authors: Ralf Guido Herrtwich, Lars Wolf
Venue: Proceedings of the 5th workshop on ACM SIGOPS European workshop: Models and paradigms for distributed systems structuring (1992)

Digital audio and video data are different from traditional media in their time-criticalness and high bandwidth requirements. These requirements and the fact that typical multimedia applications perform only few operations on the continuous-media data suggest the use of new techniques for data handling in distributed, integrated, digital multimedia systems. This paper proposes a system software structure which encapsulates the processing of continuous-media data into stream handlers of a real-time environment. This environment is controlled by traditional non-real-time functions for resource, buffer and continuous-media data stream management. On top of this system, distributed multimedia applications can be built.
Putting Your Small Business on the Web
Authors: Maria Langer
Venue:  (2000)

:Targeted for small business owners interested in how the Web can extend their business reach and profitability, this book explains how to create an online presence for an existing small business. Many business owners want to become part of the e-commerce revolution, but have unrealistic expectations that a Web site will instantly perform miracles for their company. Maria Langer includes real-life examples of small business Web sites that doÑand donÕtÑwork. Topics covered include: Building your Web site, reducing marketing costs, site setup, Web design and content, and how to work with search engines to make your site easy to find.
The strength of non-size increasing computation
Authors: Martin Hofmann
Venue: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2002)

We study the expressive power of non-size increasing recursive definitions over lists. This notion of computation is such that the size of all intermediate results will automatically be bounded by the size of the input so that the interpretation in a finite model is sound with respect to the standard semantics. Many well-known algorithms with this property such as the usual sorting algorithms are definable in the system in the natural way. The main result is that a characteristic function is definable if and only if it is computable in time O(2p(n)) for some polynomial p.The method used to establish the lower bound on the expressive power also shows that the complexity becomes polynomial time if we allow primitive recursion only. This settles an open question posed in [1, 7].The key tool for establishing upper bounds on the complexity of derivable functions is an interpretation in a finite relational model whose correctness with respect to the standard interpretation is shown using a semantic technique.
Windows NT Server 4.0 MCSE Study Guide, 1st edition
Authors: Alan R. Carter
Venue:  (1998)

:Designed exclusively for the MCSE exam, Windows NT Server 4.0 MCSE Study Guide focuses on the exam objectives without losing track of the overall context you need to master the technology. Detailed tables of contents, chapter-opening cross-references, and end-of-chapter summaries, review questions, and labs point you directly to the information you need to pass the Windows NT Server 4.0 exam.
Experimental aspect-oriented language - AspectCOOL
Authors: Enis Avdicaušević, Marjan Mernik, Mitja Lenic, Viljem Zumer
Venue: Proceedings of the 2002 ACM symposium on Applied computing (2002)

Aspect-oriented programming (AOP) is a programming technique for modularizing concerns that crosscut the basic functionality of programs. In AOP, aspect languages are used to describe properties, which crosscut basic functionality, in a clean and a modular way. AOP is currently supported mostly by aspect weavers, which require a source code for both components and aspects in order to create the final program. In this paper we have presented our approach to aspect weaving in order to achieve separate compilation. This approach to aspect weaving is used in the languages COOL and AspectCOOL, which are also presented in the paper. With this approach it is possible to apply aspects on already compiled components.
Virtual reality for education?
Authors: Don Allison, Larry F. Hodges
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2000)

It is still unclear what, if any, impact virtual reality will have on public education. The virtual reality gorilla system is being used as a testbed to study if and how virtual reality might be use ful as an aid in educating middle school children, and to investigate the issues that arise when building virtual reality systems for knowledge acquisition and concept formation.