ppxscal/embedding_network huggingface dataset:
Digital System Design Using VHDL
Authors: Chin-Hwa Lee
Venue:  (1993)

:This is a new text book introducing VHDL language and top down system design. The book emphasizes the difference between regular high level languages and VHDL. As soon as enough VHDL constructs are introduced, readers are guided through a progressive series of examples to show the modeling techniques. More complex design examples are introduced in later chapters to show the top down system design methodology.Distinguishing features includes:MSI or SSI logic circuits ModelingTiming modeling and accuracyCorresponding behavior, dataflow, and structural modelsModels of finite impulse response (FIR) filterModels of fast Fourier Transform (FFT) hardwareModels of a simple 4-bit computerModels of SCSI communication protocolModels of erasable programmable logic device (EPLD)89 examples of VHDL modelsExercises and problems at the end of the chapters 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
Age-old practices in the 'new world': a study of gift-giving between teenage mobile phone users
Authors: Alex S. Taylor, Richard Harper
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Changing our world, changing ourselves (2002)

In this paper, we present an overview of the data collected from an ethnographic study of teenagers and their use of mobile phones. Through the data, we suggest that teenagers use their phones to participate in social practices that closely resemble forms of ritualised gift-giving. Such practices, we claim, shape the way teenagers understand and thus use their phones. We go onto show that this insight into everyday, phone-mediated activities has practical implications for mobile phone design. Using an example, we describe how teenagers' gift-giving practices can inform design, providing an initial means to conceptualise future emerging technologies
The use of name spaces in plan 9
Authors: Rob Pike, Dave Presotto, Ken Thompson, Howard Trickey, Phil Winterbottom
Venue: Proceedings of the 5th workshop on ACM SIGOPS European workshop: Models and paradigms for distributed systems structuring (1992)

Plan 9 is a distributed system built at the Computing Sciences Research Center of AT&T Bell Laboratories over the last few years. Its goal is to provide a production-quality system for software development and general computation using heterogeneous hardware and minimal software. A Plan 9 system comprises CPU and file servers in a central location connected together by fast networks. Slower networks fan out to workstation-class machines that serve as user terminals. Plan 9 argues that given a few carefully implemented abstractions it is possible to produce a small operating system that provides support for the largest systems on a variety of architectures and networks. The foundations of the system are built on two ideas: a per-process name space and a simple message-oriented file system protocol.
Design, specification, and verification of interactive systems
Authors: Philippe Palanque, Fabio Paternò
Venue: ACM SIGSOFT Software Engineering Notes (2001)

More and more software applications are being developed to allow users to access data and communicate information. The parts of such applications dedicated to supporting user interactions is increasingly important and requires novel methods and techniques to develop effective user interfaces. DSV-IS'2000 provided experts from many countries of the world with the unique opportunity to meet and discuss the current state of art and new research results in this area.
The Internet Book: Everything You Need to Know about Computer Networking and how the Internet Works, 3rd edition
Authors: Douglas E. Comer
Venue:  (2000)

:The Internet Book examines computer networking and the Internet from a nontechnical perspective. It explains how computers communicate, what the Internet is, how the Internet works, and what the Internet can do for you. No background is required because early chapters clearly explain the terminology and concepts. The book focuses on fundamentals - it describes basic Internet capabilities and shows how they apply to a variety of services. When you finish reading, you will know what the Internet is, how it can be used, and why people find it so exciting. In addition, you will understand the origins of the Internet and why it is growing so rapidly. More important, you will understand the potential ways the Internet can change your life. 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
An Introduction to Natural Language Processing through PROLOG, 1st edition
Authors: Clive Matthews
Venue:  (1998)

:Research into Natural Language Processing - the use of computers to process language - has developed over the last couple of decades into one of the most vigorous and interesting areas of current work on language and communication. This book introduces the subject through the discussion and development of various computer programs which illustrate some of the basic concepts and techniques in the field. The programming language used is Prolog, which is especially well-suited for Natural Language Processing and those with little or no background in computing. An Introduction to Natural Language Processing Through Prolog is an excellent introduction to the subject for students of linguistics and computer science, and will be especially useful for those with no background in the subject.
An architecture for high-level language database extensions
Authors: C. J. Date
Venue: Proceedings of the 1976 ACM SIGMOD international conference on Management of data (1976)

This paper describes an architecture for a set of database extensions to the existing high-level languages. The scheme described forms an architecture in the sense that it is not based on any particular language: its constructs and functions, or some suitable subset of them, may be mapped into the concrete syntax of a number of distinct languages, among them COBOL and PL/I. The architecture includes both the means for specifying the programmer's view of a database (i.e. for defining the external schema) and the means for manipulating that view. A significant feature is that the programmer is provided with the ability to handle all three of the well-known database structures (relational, hierarchical, network), in a single integrated set of language extensions. Another important aspect is that both record- and set-level operations are provided, again in an integrated fashion. The objectives of the architecture are to show that it is possible for relational, hierarchical and network support to co-exist within a single language, and also, by providing a common framework and treating the three structures in a uniform manner, to shed some new light on the continuing debate on the relative merits of each.The paper is intended as an informal introduction to the architecture, and to this end includes several illustrative examples which make use of a PL/I-based concrete syntax.
Use of barrel in applications studies
Authors: Charles Minderhout, Kevin D. Reilly, John H. Barrett, John W. Gibson
Venue: Proceedings of the 20th annual Southeast regional conference (1982)

Barrel is a language-development facility, whose conceptual and theoretical bases are outlined in a companion paper. The present paper attempts to describe applications of Barrel and usages of it, on the Data General Eclipse, mostly, but also on the DEC Vax 11/750.The studies in which Barrel has been applied are primarly non-numerical. An attempt is being made to develop strong capabilities in both string and list processing. An important newer form of computation: that of logic processing is being watched with some facilities for it being included in the work.Four components of Barrel are described: BMAC, basic facilities providing an interpreter with some rudimentary compiler features, reminiscent of interactive Basic; BICON, delivering string processing facilities modeled after the new string-processing language, ICON; BLISP, a (functional programming) subset of LISP; BTPS, a table-processing system which links to other (network based) table-processing software. The components operate interactively, line-by-line or in larger units of code.
Simplified Design of Micropower and Battery Circuits
Authors: John D. Lenk
Venue:  (1995)

:* Uses commercially available micropower ICs * No design experience required * Minimal theory and mathematics; full circuit operation described. 'Simplified Design of Micropower and Battery Circuits' provides a simplified, step-by-step approach to micropower and supply cell circuit design. No previous experience in design is required to use the techniques described, thus making the book well suited for the beginner, student, or experimenter as well as the design professional. Simplified Design of Micropower and Battery Circuits concentrates on the use of commercial micropower ICs by discussing selections of external components that modify the IC-package characteristics. The basic approach is to start design problems with approximations for trial-value components in experimental circuits, then to vary the component values until the desired results are produced. Although theory and mathematics are kept to a minimum, operation of all circuits is described in full. About The Author:ohn D. Lenk has been a technical author specializing in practical electronic design and troubleshooting guides for more than 40 years. An established writer of international best-sellers in the field of electronics, Mr. Lenk is the author of more than 80 books on electronics, which together have sold well over two million copies in nine languages.
The Digital Typography SourceBook
Authors: Marvin Bryan
Venue:  (1996)

:Digital Typography Sourcebook is your ultimate font reference - it tells you how to identify different fonts, where to buy them and how much you should pay, what fonts to avoid, and how to create professional looking designs. You'll become familiar with over 400 fonts, including the hottest new designs from some of the world's leading designers. With the help of hundreds of before-and-after examples, expert Marvin Bryan gives you professional techniques for making the best use of digital typography in your work. He even tells the fascinating stories of the men and women who created many well-known typefaces and the circumstances that inspired them.
A to Z of PhotoShop
Authors: Peter Bargh
Venue:  (2000)

:This book is for everyone using Photoshop: students, professionals and amateurs. It is a visual guide to Photoshop terms. Bargh provides a cross-reference chart showing the different features added in each Photoshop update. There are also comprehensive visual listings of Photoshop fonts, useful shortcuts, a visual guide to Photoshop related Web sites and record data sheets that you can use to write down your own techniques." "Clear and easy to use A to Z guide to Photoshop covering all versions from 3.0 to 5.5; full color throughout, highly visual format; includes all the vital terms you need to know when working with Photoshop; and suitable for Mac and PC users. 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
ADO.NET and ADO examples and best practices for VB programmers, 2nd edition
Authors: William R. Vaughn
Venue: .Net Developers Series (2002)

Visual Basic developers are faced with a dizzying cornucopia of choices when it comes to data access. The new .NET technology forces developers to completely rethink their data access strategies because there is an entirely new language and a new set of data access interfaces to learn and because there is an entirely new language and a new set of data access interfaces to learn and incorporate into their designs.
Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges
Authors: Bryant A. Julstrom, Günther R. Raidl
Venue: Proceedings of the 2002 ACM symposium on Applied computing (2002)

Evolutionary algorithms (EAs) that search spaces of spanning trees can encode candidate trees as sets of edges. In this case, edge-sets for an EA's initial population should represent spanning trees chosen with uniform probabilities on the graph that underlies the target problem instance. However, the generation of random spanning trees is not as simple as it might appear. Mechanisms based on Prim's and Kruskal's minimum spanning tree algorithms are not uniform, and uniform mechanisms are slow, not guaranteed to terminate, or require that the underlying graph be complete.However, a non-uniform initial population of spanning trees need not harm an EA's performance. Trials of a crossover-only EA for the One-Max-Tree problem, using Prim-based, Kruskal-based, and uniform initialization, indicate that the distribution of edges in the initial population is far more important than the distribution of trees. A skewed distribution of edges in its initial population damages the EA's performance, but this is remedied by a reasonable amount of mutation.
Integrated retiming and placement for field programmable gate arrays
Authors: Deshanand P. Singh, Stephen D. Brown
Venue: Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays (2002)

Retiming is a synchronous circuit transformation that can optimize the delay of a synchronous circuit by moving registers across combinational circuit elements. The combinational structure remains unchanged and the observable behavior of the circuit is identical to the original.In this paper, we address the problem of applying retiming techniques to circuits implemented in Field Programmable Gate Arrays (FPGAs). FPGAs contain prefabricated and configurable routing elements that allow us to easily implement a variety of circuits. However this interconnect contributes greatly to the overall delay in the implemented circuit. If a circuit is retimed prior to the placement and routing phases of the CAD flow, then it has no information about the delays introduced by the configurable interconnect. Our fundamental experiment is to determine whether there are any gains in tightly coupling retiming and placement so that the retiming algorithm has some estimate of the routing delays.Specifically, we introduce a post-placement retiming algorithm that understands how to take advantage of FPGA architectural features. This retiming algorithm may introduce extra registers into the circuit. These new registers need to be placed in some location in the FPGA. Retiming register placement is accomplished by a novel incremental clustering and placement algorithm. The incremental algorithm builds upon the placement of the non-retimed circuit to intelligently sift in the newly-introduced registers.In addition, we explore making the placement algorithms "retiming aware." These placement algorithms try to place logic blocks in such a way that the subsequent retiming produces better speed results. These techniques include the identification of retiming-critical cycles during placement.Our experiments show that the integration of retiming with placement results in 19% better clock periods in comparison to the application of retiming before the place and route steps.
Gamemaster: Conquering Sega Genesis Games, 1st edition
Authors: Jeff Rovin
Venue:  (1994)

:The most up-to-date tips and strategies for America's super-favorite videogames, including Mortal Kombat, Sonic III, Spinball, World Series Baseball, NBA Jam, Virtua Racing, and many more. New technology makes you part of the game--let GameMaster: Conquering Sega Genesis Games help you master it. Includes all-new violence ratings and reviews. 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
An application of the Bernoulli numbers to the harmonic series
Authors: Sabin Tabirca, Tatiana Tabirca
Venue: Octogon Mathematical Magazine (2001)

The aim of this article is to review an result concerning the harmonic series. The Bernoulli numbers are used to obtain an equation for this product. Some computation are presented in order to justify the theoretical result.
Course Ilt: Dreamweaver 3, 1st edition
Authors: CORPORATE Course Technology Staff
Venue:  (2000)

:An affordable, easily scannable one-day training guide designed for use in instructor-led training courses. 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
Instant messaging in Java: the Jabber protocols
Authors: Iain Shigeoka
Venue:  (2002)

This book shows you how. It covers the Jabber IM protocol and takes you through the process of building your own Jabber IM client and server in Java. It explains sending messages, updating presence, and maintaining rosters or "buddy lists," using Jabber and Java. Designed for two-way asynchronous communications, Jabber can be a better protocol for dynamic B2B XML applications than HTTP, and this too is explained in the book.
Time driven operating systems: a case study on the MARS kernel
Authors: Johannes Reisinger
Venue: Proceedings of the 5th workshop on ACM SIGOPS European workshop: Models and paradigms for distributed systems structuring (1992)

Time driven real-time systems are of increasing importance in the field of critical computer control applications [Sta90]. Because of their predictable behavior they are well suited for systems whose correct operation in the time domain must be guaranteed already in the design phase of an application. Time driven systems allow the proof of the correct timing behavior of an application by construction of a feasible schedule.In the MARS system [Kop89] the time driven approach is realized. The structure of the MARS operating system kernel differs significantly from that of others because of the specific demands which a distributed time driven system imposes on its underlying operating system. Based on the experiences with the first prototype of the MARS operating system [Dam89] (MARS-1), a new operating system kernel, MARS-2, has been developed from scratch. There have been some motivations for the development of MARS-2:&bull; New processor boards ('MARS components') have been developed to fully support the MARS concepts [Ste91]. These boards provide mechanisms to achieve a high self-checking coverage and a highly predictable timing behavior.&bull; The introduction of new concepts and mechanisms into the MARS system (e.g. membership protocol, time redundant process execution, shadow component [Kop90], [Kop91]) requires support by the runtime system.&bull; A predictable timing behavior should be achieved by the new kernel. Although the system overhead caused by the old implementation was boundable in principle, the calculated bounds were too high to guarantee the correct timing behavior of an application already at design time [Vrc91].&bull; The self-checking coverage of the MARS components has to be high because the fault tolerance mechanisms of MARS are based on it. Whereas the old kernel was not specifically designed in order to meet this requirement, MARS-2 uses both hardware and software mechanisms to increase the self-checking coverage to a sufficiently high degree.MARS-2 is based on a microkernel operating system architecture in contrast to the monolithic kernel of MARS-1.
Sams Teach Yourself Visual Basic 5 for Applications in 21 Days, 3rd edition
Authors: Matthew Harris
Venue:  (1997)

:This book covers all fundamental aspects of this programming language and teaches novice programmers how to design, create, and debug macro programs written in the VBA programming language.Covers 32-bit Microsoft Office applications running on the Windows 95 operating systemPresents VBA in a logical and easy-to-learn sequence, beginning with simple concepts and moving to more advanced materialTeaches techniques to add functionality to existing applications such as Microsoft Excel and Microsoft Access
Random projection in dimensionality reduction: applications to image and text data
Authors: Ella Bingham, Heikki Mannila
Venue: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining (2001)

Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however, empirical results are sparse. We present experimental results on using random projection as a dimensionality reduction tool in a number of cases, where the high dimensionality of the data would otherwise lead to burden-some computations. Our application areas are the processing of both noisy and noiseless images, and information retrieval in text documents. We show that projecting the data onto a random lower-dimensional subspace yields results comparable to conventional dimensionality reduction methods such as principal component analysis: the similarity of data vectors is preserved well under random projection. However, using random projections is computationally significantly less expensive than using, e.g., principal component analysis. We also show experimentally that using a sparse random matrix gives additional computational savings in random projection.
Computers: Tools for an Information Age
Authors: Harriet L. Capron
Venue:  (1997)

:The new edition of this bestselling computer concepts book focuses on the explosive growth of the Internet. Many topics have been updated or added, including web page design, ethics, Office 97, and push technology. Includes Capron's Pocket Internet, a resource manual with fun and interesting websites organized by category.
An authorization model for a public key management service
Authors: Pierangela Samarati, Michael K. Reiter, Sushil Jajodia
Venue: ACM Transactions on Information and System Security (TISSEC) (2001)

Public key management has received considerable attention from both the research and commercial communities as a useful primitive for secure electronic commerce and secure communication. While the mechanics of certifying and revoking public keys and escrowing and recovering private keys have been widely explored, less attention has been paid to access control frameworks for regulating access to stored keys by different parties. In this article we propose such a framework for a key management service that supports public key registration, lookup, and revocation, and private key escrow, protected use (e.g., to decrypt selected messages), and recovery. We propose an access control model using a policy based on principal, ownership, and authority relationships on keys. The model allows owners to grant to others (and revoke) privileges to execute various actions on their keys. The simple authorization language is very expressive, enabling the specification of authorizations for composite subjects that can be fully specified (ground) or partially specified, thus making the authorizations applicable to all subjects satisfying some conditions. We illustrate how the access control policy and the authorizations can easily be expressed through a simple and restricted, hence efficiently computable, form of logic language.