ppxscal/embedding_network huggingface dataset:
Introduction to Wireless Local Loop, 1st edition
Authors: William E. Webb
Venue:  (1998)

:Here's a comprehensive, easy-to-understand guide to the underlying technologies, key selection criteria, and design and deployment processes behind wireless local loop (WLL) systems. The book helps technical professionals develop a sound understanding of WLL system design procedures, and provides practical guidance on choosing the best WLL and access technologies. It's unique in its clear presentation of both the technical and business issues associated with wireless in the local loop. If you're a WLL engineer, or a non-technical manager, marketer, or regulator involved in WLL system development, you'll find the information in this book invaluable. Well written introductory chapters discuss the main areas of the telecommunications environment, and the concepts of convergence and access technologies. You learn why wireless in the local loop is seriously challenging the use of traditional copper cable, the economic issues behind wired and wireless interconnection, and even some expert WLL market forecasts. Other advanced, practical sections...  Identify and describe key WLL parameters, including range and capacity  Evaluate various access technologies, and guide you in the selection process  Examine the CDMA/TDMA debate, and consider which represents a better access technique  Detail the network deployment process, with the help of an actual case study  Show you how to effectively target your telecom service in a wide range of environments  Describe how to apply for a license, choose a service offering, and develop the business case  Discuss critical customer service issues
VHDL for Logic Synthesis, 2nd edition
Authors: Andrew Rushton
Venue:  (1998)

:VHDL (Very high-speed circuit Hardware Description Language) is firmly established in an industrial context, and is the worldwide standard for computer-aided electronic system design. This title focuses on logic synthesis, or the design-to-implementation phase of the VHDL cycle in generating the hardware. VHDL for Logic Synthesis was originally written as an introductory and reference text on VHDL for engineers intending to use logic synthesis, but the updated and revised second edition is intended for a broader readership by providing comprehensive coverage of the VHDL language and its use in the process of generating hardware.
Shockwave for Dummies (with CD-ROM), 2nd edition
Authors: Greg Harvey
Venue:  (1997)

:Shockwave For Dummies, 2nd Edition, is for Mac and PC users who want to include cool and dynamic sound, animation, and genuine interactivity in their Web pages by using Macromedia's hot new Shockwave technology. This easy-to-use reference delivers information about creating Shockwave movies made with Macromedia Flash, Director, and Authorware, as well as adding compressed, streaming audio with Shockwave Audio. Inside, find helpful advice on how to Make small, efficient Shockwave movies with Greg's tips and tricks Create snazzy, animated Web banners with Flash 2 Implement Web page controls with buttons or hyperlinks for navigating your site Add really huge sound files to your Shockwave movies with Shockwave Audio Create streaming Director Shockwave movies that begin playing on your Web site visitor's computer as soon as the first few frames are downloaded Use Director 6 netLingo commands to control the Shockwave movies you place on your Web pages Visit Greg's Web site and find all the example Shockwave movies described in this book
Novell's Four Principles of Nds Design, 1st edition
Authors: Jeffrey F. Hughes
Venue:  (1996)

:I
Microsoft Excel 2000 Quick Source Guide, 1st edition
Authors: CORPORATE Quick Source Staff
Venue:  (1999)

:This 6 page, tri-fold full-color guide is an invaluable resource for anyone who uses Excel 2000! It provides step by step instructions on how to create workbooks, move and copy worksheets, work with rows and columns, format cells, enter data, use autofill and autocomplete, create formulas, use relative and absolute references, create charts and data maps, print, and much more. An excellent instructional tool for a user new to Excel, it also serves as a handy reference tool for the more experienced user.Author Biography: Quick Source is a national supplier of training materials to corporations throughout the United States. 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
Recognizing string graphs in NP
Authors: Marcus Schaefer, Eric Sedgwick, Daniel Štefankovič
Venue: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002)

A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curves intersect. We show that string graphs can be recognized in NP. The recognition problem was not known to be decidable until very recently, when two independent papers established exponential upper bounds on the number of intersections needed to realize a string graph [18, 20]. These results implied that the recognition problem lies in NEXP. In the present paper we improve this by showing that the recognition problem for string graphs is in NP, and therefore NP-complete, since Kratochv&iacute;l [12] showed that the recognition problem is NP-hard. The result has consequences for the computational complexity of problems in graph drawing, and topological inference.
Technologies for families
Authors: Catherine Plaisant, Allison Druin, Hilary Hutchinson
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

In this workshop, we propose to bring together researchers from industry and academia to discuss the design of new technologies for families. We will focus on both design techniques and the technologies themselves. Through discussions and brainstorming we hope to discover new ideas, which can be disseminated more broadly.
Jumping to Java: Fast Track for C and C++ Programmers
Authors: Dan Parks Sydow
Venue:  (1996)

:Transfer your C and C++ skills to the new programming world of Java At last, a book for experienced programmers who want to use their C and C++ knowledge to leap to the thriving world of Java programming! This high-energy guide will get you there fast, without feeding you chapter after chapter of beginning programming concepts. You'll sprint through detailed explanations and illustrations that build on your current skills for a smooth and speedy transition to Java. And you'll find even more hands-on practice with the reusable source code on CD. This complete package has everything you need to make what could be the most important jump of your career. Develop your edge to stay competitive Charge ahead to Java instruction without being hindered by basic programming how-to's Learn about the basics of the Java programming language, from syntax to streams Discover the edge of Java memory management Create Java applets on any platform, whether you're a Windows, Windows NT, Mac, or Unix developer Get in-depth illustrations and sample code that demonstrate how to handle the toughest challenges Start programming as early as Chapter 2!
The ten commandments of data warehousing
Authors: David Sammon, Pat Finnegan
Venue: ACM SIGMIS Database (2000)

Data warehousing can offer great potential for organizations. Nevertheless, implementing a data warehouse is a complex project that has caused difficulty for organizations. This paper presents the results of a study of four mature users of data warehousing technology. Collectively, these organizations have experienced many problems and solutions in relation to implementing data warehousing. These experience are captured in the form of ten organizational prerequisites for implementing data warehousing. The authors believe that this model could potentially be used by organizations to internally assess the likelihood of data warehousing project success, and to identify the areas that require attention prior to commencing implementation.
Software Factory Challenge, 1st edition
Authors: H. Weber
Venue:  (1997)

:The Eureka Software Factory project (ESF) was set up by a Group of European partners in 1987. Its objective was broadly to improve the large-scale software production process by introducing an industrialised approach to have The Software Factory Challenge social, organisational and technical aspects. The project was set up under the pan-European Eureka programme, and it was funded by the partners together with their national governments. This book is not a history of the ESF project, but rather a presentation of its main ideas and achievements, and an account of how the concepts pioneered by the project have become part of a general movement in both the industrial and academic domains. In this movement, the facility for the production, use and maintenance of large-scale computer artefacts (the Software Factory) is treated in a wide and `organic' way, so as to include concepts such as business value and process improvement; with the development of new technologies being driven by these new, wide requirements. This new approach is in contrast with a narrowly technological one, in which individual tasks like programming are aided by machines but in which the production process as a whole is not supported. The main body of the book is divided into four Parts. Part I gives a short overview of the ESF project and its ideas, and goes on to attempt to place the ESF work in the context of industry as a whole (with reference to both producers and users of Information Technology systems). Part II sets out to explain the technological basis of the Software Factory as seen by ESF and goes on to describe some experimental and pioneering implementations of Factory Support Environments and theirconstituents. Part III is devoted to the most complete implementation of an ESF Factory Support Environment to date, Kernel/2r. This Section provides a highly detailed discussion of both design and implementation issues. In Part IV addresses what deployment strategies are now available to continue the spread of these ideas in order to meet the goal of better software-based systems (i.e. systems which are safer, more economical to build, more easily changed and more useful than those that have been built up to now). Finally, a Glossary of Terms and a list of References is given. Readers: those who have a professional interest in Information Technology. 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
Quatum logic, Hilbert space, revision theory
Authors: Kurt Engesser, Dov M. Gabbay
Venue: Artificial Intelligence (2002)

Our starting point is the observation that with a given Hilbert space H we may, in a way to be made precise, associate a class of non-monotonic consequence relations in such a way that there exists a one-to-one correspondence between the rays of H and these consequence relations. The projectors in Hilbert space may then be viewed as a sort of revision operators. The lattice of closed subspaces appears as a natural generalisation of the concept of a Lindenbaum algebra in classical logic. The logics presentable by Hilbert spaces are investigated and characterised. Moreover, the individual consequence relations are studied. A key concept in this context is that of a consequence relation having a pointer to itself. It is proved that such consequence relations have certain remarkable properties in that they reflect their metatheory at the object level to a surprising extent. The tools used in the investigation stem from two different areas of research, namely from the disciplines of non-monotonic logic on the one hand and from Hilbert space theory on the other. There exist surprising connections between these two fields of research the investigation of which constitutes the purpose of this pape
Partial correctness for probabilistic demonic programs
Authors: A. K. McIver, Carroll Morgan
Venue: Theoretical Computer Science (2001)

Recent work in sequential program semantics has produced both an operational (He et al., Sci. Comput. Programming 28(2, 3) (1997) 171-192) and an axiomatic (Morgan et al., ACM Trans. Programming Languages Systems 18(3) (1996) 325-353; Seidel et al., Tech Report PRG-TR-6-96, Programming Research group, February 1996) treatment of total correctness for probabilistic demonic programs, extending Kozen's original work (J. Comput. System Sci. 22 (1981) 328-350; Kozen, Proc. 15th ACM Symp. on Theory of Computing, ACM, New York, 1983) by adding demonic nondeterminism. For practical applications (e.g. combining loop invariants with termination constraints) it is important to retain the traditional distinction between partial and total correctness. Jones (Monograph ECS-LFCS-90-105, Ph.D. Thesis, Edinburgh University, Edinburgh, UK, 1990) defines probabilistic partial correctness for probabilistic, but again not demonic programs. In this paper we combine all the above, giving an operational and axiomatic framework for both partial and total correctness of probabilistic and demonic sequential programs; among other things, that provides the theory to support our earlier---and practical---publication on probabilistic demonic loops (Morgan, in: Jifeng et al. (Eds.), Proc. BCS-FACS Seventh Refinement Workshop, Workshops in Computing, Springer, Berlin, 1996. Copyright 2001 Elsevier Science B.V.
A musical instrument for facilitating musical expressions
Authors: Kazushi Nishimoto, Chika Oshima, Yohei Miyagawa, Takashi Shirosaki
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

In this paper, we propose a new musical instrument that allows people to concentrate on controlling indiscrete elements so that they can directly create their musical expressions. We describe a prototype musical instrument and demonstrate two applications of the prototype to show its effectiveness.
NetWare Training Guide: CNA Study Guide/Book and Disk
Authors: Dorothy L. Cady
Venue:  (1994)

:This guide provides candidates for Certified NetWare Administration (CNA) certification with an alternative to classroom study by helping them prepare for the CNA exam.Covers NetWare Administrator testsShows users how to plan, manage, use, optimize, and maintain networksDisk contains New Riders' Electronic TestPrep, which emulates many of the features of the Drake Certification tests
Configuring XDM
Authors: Ron Hume
Venue: Linux Journal (2001)

Taking advantage of this vnc alternative.
IDDS: an interactive decentralized documentation system
Authors: Christoph Meinel, Harald Sack, Volker Schillings
Venue: Proceedings of the 19th annual international conference on Computer documentation (2001)

The paper describes the design and the application of an Interactive Decentralized Documentation System (IDDS). IDDS is a web-based, interactive documen-tation system that is especially designed for the support of working groups distributed over many places. It enables the creation of "just-in-time"-documentation and provides authoring tools for multimedia documents supporting multiple authors per document including a versioning system. IDDS provides an HTML-frontend for being accessible anywhere with a standard web-browser for creating, reading, or commenting on the provided documentation. The workflow of IDDS includes an interactive and guided reviewing process of the documentation including security mechanisms that are designed to maintain a high quality of the created documentation. Furthermore, first experiences of the application of IDDS in a system and network-administration environment are given.
Information architecture: a new discipline for organizing hypertext
Authors: Paul Kahn
Venue: Proceedings of the 12th ACM conference on Hypertext and Hypermedia (2001)

Hypertext has always been about allowing us to connect information in creative and useful ways. Anything can be linked to anything. This is the promise and problem of hypertext. It is possible to link things well but far easier to link things badly. The result is spaghetti writing to go with our spaghetti code, masses of senseless trails and tunnels where the reader loses all sense of attention and purpose. The computer science community responded to this diet of pasta with new practices, promoting interoperable, repeatable, reusable, object-oriented programming tools.
EDF scheduling using two-mode voltage-clock-scaling for hard real-time systems
Authors: Yann-Hang Lee, Yoonmee Doh, C. M. Krishna
Venue: Proceedings of the 2001 international conference on Compilers, architecture, and synthesis for embedded systems (2001)

Scaling down power supply voltage yields a quadratic reduction in dynamic power dissipation and also requires a reduction in clock frequency. In order to meet task deadlines in hard real-time systems, the delay penalty in voltage scaling needs to be carefully considered to achieve low power consumption. In this paper, we focus on dynamic reclaiming of early released resources in Earliest Deadline First (EDF) scheduling using voltage scaling. In addition to a static voltage assignment, we propose a new dynamic-mode assignment, which has a flexible voltage mode setting at run-time enabling much larger energy savings. Using simulation results and exploiting the interplay between power supply voltage, frequency, and circuit delay in CMOS technology, we find the optimal two-level voltage settings that minimize energy consumption.
Advanced Spreadsheet Design Using Lotus Macros
Authors: Maureen C. Thommes
Venue:  (1994)

:No other resource provides such an outstanding standardized methodology for developing advanced spreadsheet designs. This book presents full problem analyses of input and output components, layout, testing, and documentation. Readers learn how to fully exploit the Lotus macro language in the creation and application of spreadsheets.
An assume-guarantee rule for checking simulation
Authors: Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajamani, Serdar Tasiran
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2002)

The simulation preorder on state transition systems is widely accepted as a useful notion of refinement, both in its own right and as an efficiently checkable sufficient condition for trace containment. For composite systems, due to the exponential explosion of the state space, there is a need for decomposing a simulation check of the form P &le;s Q, denoting "P is simulated by Q," into simpler simulation checks on the components of P and Q. We present an assume-guarantee rule that enables such a decomposition. To the best of our knowledge, this is the first assume-guarantee rule that applies to a refinement relation different from trace containment. Our rule is circular, and its soundness proof requires induction on trace trees. The proof is constructive: given simulation relations that witness the simulation preorder between corresponding components of P and Q, we provide a procedure for constructing a witness relation for P &le;s Q. We also extend our assume-guarantee rule to account for fairness constraints on transition systems.
Microsoft Internet Explorer 4 Technical Support Training Kit, 1st edition
Authors: CORPORATE Microsoft Corporation Staff
Venue:  (1997)

:With this single kit, support professionals can prepare for success at work and on the Microsoft Certified Professional (MCP) exam. Through modular lessons and hands-on labs, you'll learn to install, configure, deploy, and support Internet Explorer 4 in a networked environment. You'll also get specific preparation for the exam. Plus, this is Microsoft Official Curriculum - the only self-paced training that's adapted by Microsoft from the corresponding Microsoft-authorized instructor-led course. 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
Law and the Information Superhighway, 2nd edition
Authors: Henry H. Perritt
Venue:  (2000)

:This trailblazing book provides an analysis of the important legal issues that arise as the electronic information infrastructure matures. Explains the interrelationship among various areas of law including intellectual property, access rights, tort and criminal liability and privacy. Describes the latest techniques of electronic publishing, e-mail and the Internet. Explores the convergence of cable television and telephone technologies. 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
Information Management: The Organizational Dimension
Authors: Michael J. Earl
Venue:  (1998)

:This volume is a sequel to Information Management: The Strategic Dimension (OUP, 1988), a book which was well received by managers and academics alike. The purpose of this book is to take an informed, dispassionate and constructive look, based on research, at the challenges of IT and to offer insight, analysis and guidance on the ever changing IT environment, focusing in particular on managerial and organizational issues. These include centralization versus decentralization, relations between users and specialists, managing the IS function, outsourcing versus internal capabilities, project management and systems implementation, and an assessment of Business Process Re-engineering at both the conceptual and empirical level. The book provides an authoritative overview and helpful diagnosis of current information management challenges by some of the leading information systems researchers in Europe and the USA. The volume will be essential reading for IT researchers, management consultants and senior IT professionals.
Analyzing and compressing assembly code
Authors: Christopher W. Fraser, Eugene W. Myers, Alan L. Wendt
Venue: ACM SIGPLAN Notices (1984)

This paper describes the application of a general data compression algorithm to assembly code. The system is retargetable and generalizes cross-jumping and procedural abstraction. It can be used as a space optimizer that trades time for space, it can turn assembly code into interpretive code, and it can help formalize and automate the traditionally ad hoc design of both real and abstract machines.