ppxscal/embedding_network huggingface dataset:
Voice over Frame Relay
Authors: William A. Flanagan
Venue:  (1997)

:Voice Over Frame Relay - the next practical way to reduce your network costs! Savings from putting voice tie lines on frame relay data networks can pay back the additional investment in voice equipment in just months. Savings on international circuits are large enough to threaten present tariff structures (with some help from the FCC). From being "impossible," VoFR has become an essential element to be considered by network designers. This includes those who historically worked with data as well as those concerned primarily with voice. The goal of this book is to make it easy for anyone with a voice or data background to understand this new fusion technology, VoFR.Author Biography: William A. Flanagan is vice president of marketing and technology at FastCommunications Corp. where he guides product development and marketing strategy. He also represents the company at the Frame Relay Forum, seminars, and other industry events.
Space and the Global Village: Tele-Services for the 21st Century: Symposium Proceedings International Symposium 3-5 June 1998, Strasbourg, France
Authors: G. Haskell, Michael J. Rycroft
Venue:  (1999)

:An international and interdisciplinary Symposium was organized by the International Space University to bring together technical and non-technical people to consider the future applications of space techniques to tele-services. The Proceedings of this Symposium are essential reading for all who should appreciate the broad range of issues involved in this developing area.
AutoMod: the AutoMod product suite tutorial
Authors: Brian Stanley
Venue: Proceedings of the 33nd conference on Winter simulation (2001)

Whether designing a new system or modifying an existing one, engineers want to take the guesswork out of finding the best possible solution. While there are many analysis methods for designing industrial systems, simulation remains the method that provides the highest level of confidence that a system will perform. A well-written simulation model can be a valuable tool in the design, analysis, and operation of manufacturing and other complex systems. The AutoMod Product Suite from Brooks Automation, AutoSimulations Division has been used on 1000s of projects to help engineers and managers make the best decisions possible.
Human-Computer Interaction
Authors: Jenny Preece, Yvonne Rogers, Helen Sharp, David Benyon, Simon Holland, Tom Carey
Venue:  (1994)

:Offering the most comprehensive account of the multidisciplinary field of HCI, this book illustrates the powerful benefits of a user-oriented approach to the design of modern computer systems. It balances the technical and cognitive issues required for understanding the subtle interplay between people and computers, particularly in emerging fields like multimedia, virtual environments and computer supported cooperative work (CSCW). A unique feature is the inclusion of interviews with many leading authorities in HCI, providing personal insight into their work and conveying the excitement of current research activity: Deborah Hix, Roy Kalawsky, Marilyn Mantei, Tom Moran, Donald Norman, Brian Shackel, Ben Shneiderman, Bill Verplank, and Terry Winograd. Human-Computer Interaction is flexibly structured to allow a variety of learning paths for students in computer science, engineering, psychology and cognitive science. Programmers and system designers will appreciate its emphasis on the design of interactive systems.
ASP Programmer's Reference
Authors: Dan Maharry, David Sussman
Venue:  (1998)

:What is the Subject Area?This book provides a reference to Microsoft Active Server Pages version 2.0, one of the key technologies underpinning the Microsoft Web Server, Internet Information Server 4. ASP allows server side scripting to dynamically construct web pages, interact with server based components, such as business objects, and manipulate databases.What's Great About this Book? Provides a concise and yet comprehensive guide to the ways ASP 2 can be used in all kinds of applications. Details the standard server components, how they are used, and how they interact. Briefly details the use of databases with ADO. A liberal sprinkling of code samples to explain the topics. Includes a reference section for fast access to detailed lists of the objects, properties and methods available. Who is this Book for?This book is aimed at the web site developer who needs a comprehensive reference to ASP, and is suitable for both beginner and experienced ASP developer alike. Its reference style is aimed to provide quick access to specific content, with code samples to explain the techniques used.
Computer Ethics: Cautionary Tales and Ethical Dilemmas in Computing, 2nd edition
Authors: Tom Forester, Perry Morrison
Venue:  (1993)

:For anyone interested in the issues arising from computer malfunctions and, more perniciously, from misuse, this new edition of Computer Ethics is right on the mark. Widely acclaimed for its readability and its balanced and authoritative coverage, Computer Ethics has been thoroughly revised and updated with new anecdotes, new revelations, and lively discussion of the ethical, social, and professional issues arising from the computer revolution, such as computer crime, software theft, hacking, viruses, and the invasion of privacy. An entirely rewritten first chapter is followed by expanded chapters that contain compelling new case studies and analyses. A new final section contains 10 hypothetical scenarios for group discussion. Copies of the ACM Code of Ethics and the ACM-IEEE Computing Curricula are included in the appendixes. Tom Forester is Senior Lecturer in the School of Computing and Information Technology at Griffith University, Queensland, Australia, and is editor or author of seven books on the social aspects of computers. Perry Morrison lectures in psychology at the National University of Singapore.
Java Security Handbook
Authors: Jamie Jaworski, Paul Perrone, Venkata S. Chaganti
Venue:  (2000)

:This book is a comprehensive guide to Java security issues. It assumes you are an experienced Java programmer, but have little experience with creating secure applications. This book covers formulating and enacting a network security policy to protect end-users, building e-commerce and database applications that can safely exchange secure information over networks and the Internet, cryptography, digital signatures, key management, and distributed computing: CORBA, RMI, and servlets.
Berkeley DB with Other
Authors: Stephanie Wall
Venue:  (2001)

:Small, special-purpose computing devices and high-end core Internet servers need fast, reliable database management. Berkeley DB is an embedded database that provides high-performance, scalable, transaction-protected and recoverable data management services to applications. Extremely portable, this library runs under almost all UNIX and Windows variants, as well as a number of embedded, real-time operating systems.Berkeley DB is the ultimate resource for the world's most widely deployed embedded database engine. This book will aid software architects and engineers, product managers, and systems and network administrators without the overhead imposed by other database products.Designed by programmers for programmers, this classic library style toolkit provides a broad base of functionality to application writers. This book will help you to make intelligent choices about when and how to use Berkeley DB to meet your needs.You can visit the Sleepycat website to get the latest errata for this book.NOTE: The first printing of this book contained an error in the table of contents that caused the page numbers to be off. This will be corrected in the second printing. If you have an earlier edition, you can download a pdf of the correct table of contents that you can print out and use with your book. If you have any questions, please feel free to contact the editor of this book at stephanie.wall@newriders.com.
The Internet for Dummies, 8th edition
Authors: John R. Levine, Carol Baroudi, Margaret Levine-Young, Margaret Levine Young
Venue:  (2002)

:ISPs. URLs. DSL. If you're new to the Internet, all that technobabble can be confusing. Relax! With the friendly advice and plain-English explanations in this bestselling guide, you'll soon be swapping e-mails, sending instant messages, surfing the Web, managing your money online ... and maybe even creating your own personal Web page!
Java Programming for Dummies with Cdrom, 3rd edition
Authors: Donald J. Koosis, David Koosis
Venue:  (1998)

:Finally, the Java book you've been looking for! Java Programming For Dummies, 2nd Edition, is the fun and easy-to-use reference that introduces you to the world of Java 1.1.1 programming and shows that you don't need a degree in computer science to understand this powerful language. This book helps you create various Java programs, including applets that travel all over the Internet and run on all types of computers: PCs, Macs, or Sun Solaris workstations. Discover how to add interactivity and computer power to Web pages on the Internet as well as to your company's internal network! Inside, find helpful advice on how to Produce dynamic Web pages that respond to the user Use the World Wide Web to give customers and clients access to corporate information Create sprites, bots, and other fun applets that get your Web pages noticed Tap into the power of the user's computers to transfer mini-programs without losing or corrupting any data Write Java 1.1.1 code once and then use it again and again in other applications Create a variety of games that you can play across the Internet
Using Digital Cameras: A Comprehensive Guide to Digital Image Capture
Authors: Joel Butkowski, Andra Van Kempen
Venue:  (1997)

:Photographers and desktop publishers eager to be up-to-date on digital-camera technology will find clearly written, easy-to-understand information in this comprehensive guide. Using Digital Cameras is the first book to describe the basics of digital cameras and how their images are reproduced in the computerized formats used in prepress work. The book explains how digital cameras work, provides an overview of the many different types and models of the latest digital cameras available, and addresses issues regarding image storage and output. Half the book showcases the work of professional photographers who regularly use digital image capture. This lavishly illustrated gallery, complete with diagrams, demonstrates that digital photography can be effectively used for a wide range of subjects, from food, to portraits, to landscapes, to cars. These images and the detailed descriptions of how they were achieved are sources of both information and inspiration.
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
Authors: Alessio Massaro, Marcello Pelillo, Immanuel M. Bomze
Venue: SIAM Journal on Optimization (2002)

Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having largest total weight. The problem is known to be NP-hard, even to approximate. Motivated by a recent quadratic programming formulation, which generalizes an earlier remarkable result of Motzkin and Straus, in this paper we propose a new framework for the MWCP based on the corresponding linear complementarity problem (LCP). We show that, generically, all stationary points of the MWCP quadratic program exhibit strict complementarity. Despite this regularity result, however, the LCP turns out to be inherently degenerate, and we find that Lemke's well-known pivoting method, equipped with standard degeneracy resolution strategies, yields unsatisfactory experimental results. We exploit the degeneracy inherent in the problem to develop a variant of Lemke's algorithm which incorporates a new and effective "look-ahead" pivot rule. The resulting algorithm is tested extensively on various instances of random as well as DIMACS benchmark graphs, and the results obtained show the effectiveness of our method.
Mining long sequential patterns in a noisy environment
Authors: Jiong Yang, Wei Wang, Philip S. Yu, Jiawei Han
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

Pattern discovery in long sequences is of great importance in many applications including computational biology study, consumer behavior analysis, system performance analysis, etc. In a noisy environment, an observed sequence may not accurately reflect the underlying behavior. For example, in a protein sequence, the amino acid N is likely to mutate to D with little impact to the biological function of the protein. It would be desirable if the occurrence of D in the observation can be related to a possible mutation from N in an appropriate manner. Unfortunately, the support measure (i.e., the number of occurrences) of a pattern does not serve this purpose. In this paper, we introduce the concept of compatibility matrix as the means to provide a probabilistic connection from the observation to the underlying true value. A new metric match is also proposed to capture the "real support" of a pattern which would be expected if a noise-free environment is assumed. In addition, in the context we address, a pattern could be very long. The standard pruning technique developed for the market basket problem may not work efficiently. As a result, a novel algorithm that combines statistical sampling and a new technique (namely border collapsing) is devised to discover long patterns in a minimal number of scans of the sequence database with sufficiently high confidence. Empirical results demonstrate the robustness of the match model (with respect to the noise) and the efficiency of the probabilistic algorithm.
FrontPage 2000: Get Professional Results, 1st edition
Authors: Sherry London
Venue:  (2000)

:Your step-by-step guide to creating high-impact Web sites with FrontPage 2000. Produce dynamic,graphics-enhanced Web sites in no time with help from FrontPage 2000: Get professional Results. Thirty-two pages of full-color examples that illustrate the professional results in action,and chapters explain in step-by-step detail how to achieve those results quickly and easily. You'll learn to format text; include graphics; multimedia,and maintain your site. This is richly illustrated guide shows you everything you need to know to create high-quality Web sites with FrontPage 2000. Inside,learn how to: Develop a framework for your Web siteSet up a robust,professional-quality siteFormat your text using FrontPage's WYSIWYG editorInclude forms,tables,frames,graphics,and linksLearn the basics of HTML editingAdd interactive graphics and multimedia using DHTML and JavaScriptIncorporate movies and audio into your siteGo livepublish your site on the WebMonitor,maintain,and troubleshoot your site
Space-time tradeoffs for linear recursion
Authors: Sowmitri Swamy, John E. Savage
Venue: Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1979)

A linear recursive procedure is one in which a procedural call can activate at most one other procedural call. When linear recursion cannot be replaced by iteration, it is usually implemented with a stack of size proportional to the depth of recursion. In this paper we analyze implementations of linear recursion which permit large reductions in storage space at the expense of a small increase in computation time. For example, if the depth of recursion is n, storage space can be reduced to &radic;n at the cost of a constant factor increase in running time. The problem is treated by abstracting linear recursion into the pebbling of a simple graph and for this abstraction we exhibit the optimal space-time tradeoffs.
Resource-Based Striping: An Efficient Striping Strategy for Video Servers Using Heterogeneous Disk-Subsystems
Authors: Jen-Wen Ding, Yueh-Min Huang
Venue: Multimedia Tools and Applications (2003)

In building a large-scale video server, it is highly desirable to use heterogeneous disk-subsystems for the following reasons. First, existing disks may fail, especially in an environment with a large number of disks, enforcing the use of new disks. Second, for a scalable server, to cope with the increasing demand of customers, new disks may be needed to increase the server&apos;s storage capacity and throughput. With rapid advances in the performance of disks, the newly added disks generally have a higher data transfer rate and a larger storage capacity than the disks originally in the system. In this paper, we propose a novel striping scheme, termed as resource-based striping (RBS), for video servers built on heterogeneous disks. RBS combines the techniques of wide striping and narrow striping so that it can obtain the optimal stripe allocation and efficiently utilize both the I/O bandwidth and storage capacity of all disks. RBS is suitable for applications whose files are not updated frequently, such as course-on-demand and movie-on-demand. We examine the performance of RBS via simulation experiments. Our results show that RBS greatly outperforms the conventional striping schemes proposed for video servers with heterogeneous or homogeneous disks, in terms of the number of simultaneous streams supported and the number of files that can be stored.
Program visualisation for visual programs
Authors: James Noble, Robert Biddle
Venue: Australian Computer Science Communications (2002)

The Nord Modular music synthesiser system comprises a stand-alone array of digital signal processors programmed by a dataflow visual langauage and supported by a visual programming environment that runs on commodity hardware. We have investigated applying program visualisation techniques to over 400 Nord Modular programs. Our visualisations make explicit module types and signal flows that are only implicit in the metaphorical graphical syntax adopted by the Nord Modular visual programming language. We have also analysed the programming style used in Nord Modular programs, in particular, the direction of program layouts. While we found that programs tended to arrange signal flow top down and left to right, we found much more variation than we expected, both within individual programs and across the Nord factory program corpus.
Mobile ad hoc networking and the IETF
Authors: Joseph P. Macker, M. Scott Corson
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1998)

This article provides a snapshot of work underway within the Mobile Ad hoc NETworks (MANET) Working Group of the Internet Engineering Task Force (IETF). The article presents some issues currently under discussion on the MANET mailing list, and also summarizes the proceedings of the last MANET WG meeting.
10 Minute Guide to WordPerfect 6.1 for Windows, 1st edition
Authors: Joe Kraynak
Venue:  (1994)

:This tutorial provides users with quick and easy answers to the most used WordPerfect for Windows features. Goal-oriented lessons help readers quickly create impressive documents, letters, reports, memos, and more.Covers all the most commonly used features of WordPerfect 6.1 for WindowsProvides Plain English definitions of unfamiliar terms, plus Panic Button troubleshooting adviceExplains how to manage features such as tables, styles, and spreadsheets
Sharing and building digital group histories
Authors: Chia Shen, Neal B. Lesh, Frederic Vernier, Clifton Forlines, Jeana Frost
Venue: Proceedings of the 2002 ACM conference on Computer supported cooperative work (2002)

Organizations, families, institutions evolve a shared culture and history. In this work, we describe a system to facilitate conversation and storytelling about this collective past. Users explore digital archives of shared materials such as photographs, video, and text documents on a tabletop interface. Both the software and the interface encourage natural conversation and reflection. This work is an application of our ongoing research on systems for multiple, co-present users to explore digital collections. In this paper, we present a case study of our own group history along with the software extensions developed for this scenario. These extensions include methods for easily branching off from and returning to previous threads of the exploration, incorporating background contexts that support a variety of view points and flexible story sharing, and supporting the active and passive discovery of relevant information.
Automatic generation of near-optimal linear-time translators for non-circular attribute grammars
Authors: Rina Cohen, Eli Harry
Venue: Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1979)

Attribute grammars are an extension of context-free grammars devised by Knuth as a formalism for specifying the semantics of a context-free language along with the syntax of the language. The syntactic phase of the translation process has been extensively studied and many techniques are available for automatically generating efficient parsers for context-free grammars. Attribute grammars offer the prospect of similarly automating the implementation of the semantic phase. In this paper we present a general method of constructing, for any non-circular attribute grammar, a deterministic translator which will perform the semantic evaluation of each syntax tree of the grammar in time linear with the size of the tree. Each tree is traversed in a manner particularly suited to the shape of the tree, yielding a near optimal evaluation order for that tree. Basically, the translator consists of a finite set of "Local Control Automata", one for each production; these are ordinary finite-state acyclic automata augmented with some special features, which are used to regulate the evaluation process of each syntax tree. With each node in the tree there will be associated the Local Control Automaton of the production applying at the node. At any given time during the translation process all Local Control Automata are inactive, except for the one associated with the currently processed node, which is responsible for directing the next steps taken by the translator until control is finally passed to a neighbour node, reactivating its Local Control Automaton. The Local Control Automata of neighbour nodes communicate with each other.The construction of the translator is custom tailored to each individual attribute grammar. The dependencies among the attributes occurring in the semantic rules are analysed to produce a near-optimal evaluation strategy for that grammar. This strategy ensures that during the evaluation process, each time the translator enters some subtree of the syntax tree, at least one new attribute evaluation will occur at each node visited. It is this property which distinguishes the method presented here from previously known methods of generating translators for unrestricted attribute grammars, and which causes the translators to be near-optimal.