ppxscal/embedding_network huggingface dataset:
Simulation of an evolutionary tuned fuzzy dispatching system for automated guided vehicles
Authors: K. K. Tan, K. Z. Tang
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

This paper presents the development and simulation of a novel Genetic Algorithm (GA) based methodology applied to optimal tuning of a fuzzy dispatching system for a fleet of automated guided vehicles in a flexible manufacturing environment. The dispatching rules are further transformed into a continuously adaptive procedure to capitalize the online information available from a shop floor at all times. The entire problem is simulated using MATLAB/SIMULINK. The simulation results obtained show that GA is an efficient and effective tool to achieve optimal performance for the well-known NP-complete scheduling problem.
The Internet and the School Library Media Specialist: Transforming Traditional Services
Authors: Randall M. MacDonald
Venue:  (1997)

:A step-by-step guide written specifically to introduce school library media specialists to the Internet, addressing their distinct needs and the unique relationships that exist between media specialists, their students, and classroom colleagues. Steps for incorporating the Internet into the media center program, online resource identification, and descriptions of successful learning activities will have immediate application in any media center. Intended for media specialists with little or no Internet experience, it explains clearly how to incorporate the Internet into the media center, cites exemplary World Wide Web sites for media specialists, and covers the following topics: how to connect to the Internet; Internet tools and how to use them; the best ways to browse the World Wide Web and retrieve useful information; the basics of home page development; listservs and USENET groups for the school library media specialist; how to develop and evaluate Internet-based instructional activities--with illustrations of actual Internet use, and strategies for promoting responsible student use of the Internet. Helpful appendices include a guide for evaluating World Wide Web resources, a sample Internet acceptable use policy, a selective subject list of World Wide Web resources, a glossary of terms, and a bibliography of recommended titles.
Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
Authors: Ian Foster
Venue:  (1995)

:At last, a practitioner's guide to parallel programming! Students and professionals who use parallel or distributed computer systems will be able to solve real problems with Designing and Building Parallel Programs. This book provides a comprehensive introduction to parallel algorithm design, performance analysis, and program construction. It describes the tools needed to write parallel programs and provides numerous examples. A unique feature is the companion on-line version, accessible via the World Wide Web using browsers such as Mosaic. This provides a convenient hypertext version of the text with pointers to programming tools, example programs, and other resources on parallel and distributed computing.
MCSE Testprep: Windows NT Server 4 Enterprise, 2nd edition
Authors: Mary Foote
Venue:  (1998)

:This self-contained supplement gives readers practice questions paired with in-depth answers. A team of MCSEs has written and developed this "TestPrep" to prepare candidates for the Windows NT Server 4 Enterprise exam.
Strategies for successful simulation of manufacturing systems: dynamic output analysis for simulations of manufacturing environments
Authors: Peter Mullarkey, Srinagesh Gavirneni, Douglas J. Morrice
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

We describe the design and implementation of a generic, real-time, in-line output analysis procedure for controlling simulations of discrete manufacturing environments. We implemented this capability in the commercial simulation software Extend&reg;. The main issues we faced were (1) Specifying the products to evaluate, (2) Determining the batch sizes for output analysis, and (3) Defining the stopping conditions based on the confidence intervals. We implemented a significance test for correlation and used this test to dynamically adjust the batch sizes used in confidence interval estimation done using batch means. When the stability conditions have been met, the simulation prompts the user to consider stopping the simulation. On the other hand, if at the end of the run length selected by the user, the statistical conditions were not satisfied, the tool notifies the user of that fact. This capability enabled us to significantly reduce the simulation run lengths, and ensures, with little additional computational effort, that the results were reliable. We used this tool to control simulations of electronics, steel, automotive, and metal processing industries. In general, using this tool we realized a reduction of more than 40% in the time required for simulation.
Distributed query evaluation on semistructured data
Authors: Dan Suciu
Venue: ACM Transactions on Database Systems (TODS) (2002)

Semistructured data is modeled as a rooted, labeled graph. The simplest kinds of queries on such data are those which traverse paths described by regular path expressions. More complex queries combine several regular path expressions, with complex data restructuring, and with sub-queries. This article addresses the problem of efficient query evaluation on distributed, semistructured databases. In our setting, the nodes of the database are distributed over a fixed number of sites, and the edges are classified into local (with both ends in the same site) and cross edges (with ends in two distinct sites). Efficient evaluation in this context means that the number of communication steps is fixed (independent on the data or the query), and that the total amount of data sent depends only on the number of cross links and of the size of the query's result. We give such algorithms in three different settings. First, for the simple case of queries consisting of a single regular expression; second, for all queries in a calculus for graphs based on structural recursion which in addition to regular path expressions can perform nontrivial restructuring of the graph; and third, for a class of queries we call select-where queries that combine pattern matching and regular path expressions with data restructuring and subqueries. This article also includes a discussion on how these methods can be used to derive efficient view maintenance algorithms.
Oracle DBA Handbook,7.3 Edition, 2nd edition
Authors: Kevin Loney
Venue:  (1996)

:Completely revised and updated to cover Oracle7 Release 7.3, the Oracle DBA Handbook, 7.3 Edition is here to make your life as database administrator easier and more productive. It provides the information you need to effectively manage a networked or stand-alone Oracle database system. In this official handbook authorized by Oracle, expert Kevin Loney shows you how to set up a database for maximum efficiency, monitor it, tune it, and maintain security. You'll find tips on networking Oracle 7 Release 7.3 with SQL*Net on UNIX, as well as tips on using Oracle's distributed database and client-server capabilities. And you'll learn about supporting tools, including Oracle CASE, Oracle Financials, and Oracle utilities, as well as third-party tools. A command reference, configuration guidelines, and scripts are also included to help get you started in setting up your Oracle database.
Multimedia Legal Handbook
Authors: Thomas J. Smedinghoff
Venue:  (1996)

:This comprehensive guide addresses the legal issues that arise with respect to the development, protection and distribution of multimedia works. Covers copyright, trademark, unfair competition, defamation, trade secret and patent laws as well as regulations regarding the rights of publicity and privacy. Details the licensing of a vast variety of multimedia content and explains the methods for protecting one's rights or obtaining permission for the use of material owned by another party. Includes practical checklists, sample contracts and licensing agreements.
Requirements for clustering data streams
Authors: Daniel Barbará
Venue: ACM SIGKDD Explorations Newsletter (2002)

Scientific and industrial examples of data streams abound in astronomy, telecommunication operations, banking and stock-market applications, e-commerce and other fields. A challenge imposed by continuously arriving data streams is to analyze them and to modify the models that explain them as new data arrives. In this paper, we analyze the requirements needed for clustering data streams. We review some of the latest algorithms in the literature and assess if they meet these requirements.
Official Build a NetScape Intranet, 11th edition
Authors: Larry Budnick
Venue:  (1996)

:This book offers readers the chance to review SuiteSpot before investing $4,000 in it. Readers will learn how to make the most of this suite of five servers (Enterprise, Catalog, Proxy, Mail and News) plus LiveWire Pro. The author is an expert and authorized Netscape developer and this is the official book endorsed by Netscape Communications Corp.
Word for Windows 6.0 Slick Tricks, 1st edition
Authors: Kay Yarborough Nelson
Venue:  (1994)

:Designed to dramatically increase the speed and skills of post-beginner and intermediate computer users. Featuring short "recipes" for performing practical everyday tasks, advanced tasks, shortcuts and more.
Detecting graph-based spatial outliers: algorithms and applications (a summary of results)
Authors: Shashi Shekhar, Chang-Tien Lu, Pusheng Zhang
Venue: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining (2001)

Identification of outliers can lead to the discovery of unexpected, interesting, and useful knowledge. Existing methods are designed for detecting spatial outliers in multidimensional geometric data sets, where a distance metric is available. In this paper, we focus on detecting spatial outliers in graph structured data sets. We define statistical tests, analyze the statistical foundation underlying our approach, design several fast algorithms to detect spatial outliers, and provide a cost model for outlier detection procedures. In addition, we provide experimental results from the application of our algorithms on a Minneapolis-St.Paul(Twin Cities) traffic dataset to show their effectiveness and usefulness.
Single address space or private address spaces?
Authors: Jacques Mossière, Xavier Rousset de Pina
Venue: Proceedings of the 6th workshop on ACM SIGOPS European workshop: Matching operating systems to application needs (1994)

The appearance of 64 bit address space architectures (DEC Alpha, HP P/A RISC and MIPS R4000), has fostered interest in single address space operating systems. Examples of such implementations are Opal[Chase 1994], Angel[Murray 1993] and Mungi[Heiser 1993]. They all offer the following advantages: a virtual address is the universal means to reference any object in the system; therefore, there is no need for pointer swizzling, when an object is deleted, and because of the size of the address space, there is no need for address reutilization, with the expensive problems it implies (address ambiguities, dangling pointers), and, last but not least, any application program or data in the system may be statically linked. The main challenge is probably the design and implementation of a protection scheme to limit the access rights of each thread or application running in the single space. Radical proponents of "pure" single address space claim that protection is orthogonal to addressing, which is true. However, due to the limitations of hardware mechanisms to enforce protection rules, and to the distributed environment, the single space is in fact implemented by the cooperation of multiple virtual address spaces. Each protection domain is implemented by a virtual space. Another difficulty is the management of private data which implies some kind of base register addressing.Our claim in this position paper is that the management of data private to domains or threads is an intrinsic function of any distributed virtual memory system. Rather than hiding them in a single space, it is more efficient and simpler to implement these private areas at fixed locations in each virtual address space which will be dynamically bound to distinct physical locations. Hence, each address space is statically divided in two areas: a common area which is managed as a single address space, and a private area. Such a system combines the advantages of Opal-like systems concerning static addressing and linking, and those of classical virtual memory systems concerning the selection of local data.The remainder of this paper is organized as follows. In section 2 are discussed two different schemes for protection, both relying upon the capability concept. Section 3 gives an argument for the use of private data, and shows that they can be implemented at low cost. Section 4 outlines a proposal in which a shared single address space for persistent data coexists with private segments for temporary data. In conclusion, this proposal is compared to previous systems.
The ABC's of Microsoft Internet Explorer 4, 2nd edition
Authors: John J. Ross
Venue:  (1997)

:This friendly, easy-to-understand guide is designed for those who want to cruise the Internet with Internet Explorer 4, the latest version of Microsoft's popular browser. Simple, step-by-step lessons guide you through every task from making the connection to building your own Web page! 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
Adobe PhotoDeluxe "X" for Dummies, 1st edition
Authors: Julie Adair King
Venue:  (1998)

:Graphics pro Julie Adair King shows you some simple techniques and fun tricks for enhancing photos from digital cameras, touching up scanned images, and creating exciting collages.
Model composition for scheduling analysis in platform design
Authors: Kai Richter, Dirk Ziegenbein, Marek Jersak, Rolf Ernst
Venue: Proceedings of the 39th annual Design Automation Conference (2002)

We present a compositional approach to analyze timing behavior of complex platforms with different scheduling strategies. The approach uses event interfacing in order to couple previously incompatible analysis techniques which provide subsystem and component behavior. Based on these interfaces, event propagation using abstract models is used to derive global system timing properties.
Circular automata
Authors: Charles Zaiontz
Venue: Proceedings of the 14th annual Southeast regional conference (1976)

We define a finite-state machine called a circular automata (CA) which processes information in a queue; we show that any function computed (or any language recognized) by such a machine is computable (recognizable) by a Turing machine and vice versa. Space and time bounds are given for the needed simulations. Furthermore, the class of languages recognized by (non-) deterministic linear bounded automata is equal to the class of languages recognized by (non-) deterministic CA which don't expand the length of the contents of the queue. Whether every language recognized by such a non-expanding CA is recognized by a deterministic one is equivalent to the famous LBA problem.CA can be viewed as generalizations of ordinary finite automata and as a Shepherdson-Sturgis single register machine programming language. An interesting model of a non-expanding CA is that of a finite-state machine which process tapes in the form of a loop. This appears to be a very natural way to process magnetic tape which circles back on itself.
Guide to Graduate Engineering and Computer Science Programs in Canada
Authors: Education International
Venue:  (2000)

:Includes detailed information on over 90 graduate engineering and computer science programs, and features select professional development programs from across Canada. In-Depth Profiles include information such as current research areas, specializations of faculty members, research funding, and expenses and financial assistance. 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
Characterizing bipartite Toeplitz graphs
Authors: Reinhardt Euler
Venue: Theoretical Computer Science (2001)

A Toeplitz graph is a symmetric graph whose adjacency matrix is Toeplitz. If such a graph has neither loops nor multiple edges it can be defined by a 0-1 sequence. In Euler et al. (in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory '95, vol. 1, Academia Sinica, World Scientific, Singapore, 1995, pp. 119-130) infinite, bipartite Toeplitz graphs have been fully characterized. In this paper we complete these results by some structural and algorithmic properties and then turn ourselves to study the .nite case. We present a complete solution for bipartite Toeplitz graphs that are defined by a 0-1 sequence with two 1-entries, and we present several partial results for those defined by a 0-1 sequence with three 1-entries.
User performance and haptic design issues for a force-feedback sound editing interface
Authors: Lonny L. Chu
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

This paper describes current work on the design and development of haptic interfaces for use with digital sound editing software. Current systems rely on computer keyboards, mice, and sometimes passive knobs for user input and graphics and audio for feedback. The addition of haptic feedback will improve the user experience because of the additional mode of feedback received through touch. This work is focused on using a design methodology, including need finding, user observations, prototyping, and user testing to develop haptic sensations effective for manipulating sound.
CGI Developers Guide
Authors: Eugene Eric Kim
Venue:  (1996)

:This book is one of the first books to provide comprehensive information on developing with CGI (Common Gateway Interface). It covers many of the aspects of CGI including, interactivity, performance, portability, and security. After reading this book, the reader will be able to write robust, secure, and efficient CGI programs.Covers client/server programming, working with gateways, and using NetscapeReaders will master forms, image maps, dynamic displays, database manipulation, and animationCD-ROM includes source code, sample utilities, and Internet tools
From checking to inference via driving and dag grammars
Authors: Jens Peter Secher, Morten Heine Sørensen
Venue: ACM SIGPLAN Notices (2002)

Abramov and Gl&uuml;ck have recently introduced a technique called URA for inverting first order functional programs. Given some desired output value, URA computes a potentially infinite sequence of substitutions/restrictions corresponding to the relevant input values. In some cases this process does not terminate.In the present paper, we propose a new program analysis for inverting programs. The technique works by computing a finite grammar describing the set of all input that relate to a given output. During the production of the grammar, the original program is implicitly transformed using so-called driving steps. Whereas URA is sound and complete, but sometimes fails to terminate, our technique always terminates and is complete, but not sound. As an example, we demonstrate how to derive type inference from type checking.The idea of approximating functional programs by grammars is not new. For instance, the second author has developed a technique using tree grammars to approximate termination behaviour of deforestation. However, for the present purposes it has been necessary to invent a new type of grammar that extends tree grammars by permitting a notion of sharing in the productions. These dag grammars seem to be of independent interest.
FrontPage Web Publishing & Design for Dummies
Authors: Asha Dornfest
Venue:  (1996)

:Highly acclaimed by industry experts and users alike, Microsoft FrontPage 97 lets you create professional Web sites without knowing HTML. With FrontPage Web Publishing & Design For Dummies®, you're ready to publish a sophisticated Web site today! This fun and friendly reference demystifies the powerful features of FrontPage while sharing the pros' Web design secrets. Whether you're building a business site on a corporate intranet or creating a personal home page, turn to this book for down-to-earth, real-world help. Inside, find helpful advice on how to: Use FrontPage to create beautiful and useful Web pages right away Convert Microsoft Word documents, Microsoft Excel spreadsheets, and other popular file formats into Web pages Take advantage of Web publishing effects, such as tables, frames, forms, and multimedia Understand the fundamentals of Web design to ensure a successful Web presence Save time and add interactive features to your site with FrontPage WebBots Keep your site-building team on track with the help of the FrontPage To Do List and other group features Visit sites on the Web for free software and more information about FrontPage and Web publishing Plus, Asha's Top Ten Lists that introduce you to useful Internet shareware tools, hot Web resources, and more
WordPerfect 6.1 for Windows 3.1 and 95: Easy Reference Guide
Authors: Rick Sullivan
Venue:  (1996)

:This Easy Reference Guides provide step-by-step instructions on how to access and use a software feature for WordPerfect 6.1 for Windows. The command summaries provide keystroke instruction in a clear, easy-to-understand format.
Troubleshooting and Repairing PC Drives and Memory Systems, 2nd edition
Authors: Stephen J. Bigelow
Venue:  (1997)

:When your PC memory or drives suddenly show signs of trouble,general troubleshooting manuals just aren't good enough. Focus on the problem and fix it fast with the best-selling guide that provides solutions for all PC drives and cards,including nonstandard ones like Syquest and Iomega Zip drives,and even writable CDs or CD-ROM burners. Clear,concise instructions make it a snap to diagnose,repair,and keep drives running in top condition. A volume in the Troubleshooting & Repair Series. Get your drives and memory systems running quickly and efficientlyand keep them that way. Having trouble installing solid-state memory or drives on your PC? Finding that newly installed drives or memory systems conflict with existing devices or drivers? Or,worst of all,facing an outright memory failure? Good news: PC memory and drive types have mushroomed. Bad news: Today's sophisticated new setups can be difficult to configure and troubleshoot. To head off truobleor fix it fastconsult this well-illustrated,all-in-one guide. Designed especially for computer enthusiasts and technicians,it shows you how to install,configure,diagnose,and correct problems with floppy drives; hard drives; solid-state PC memory; PC Cards; CD-ROM drives; tape drives; DVD drives; and nonstandard drives such as Syquest and ZIP. PC memory is such a tricky subject that general fix-it manuals just can't address all the symptoms and solutions. This is the only repair guide with the specific answers you need. Use it to: Learn the new drive technologies and operations; eliminate the high cost and delay of outside Pc service; Make fast,accurate repairs; Keep your equipment running longer;Locate parts,materials,and information.