ppxscal/embedding_network huggingface dataset:
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Authors: Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Agelika Steger, Thomas Zeugmann
Venue: Theoretical Computer Science (2001)

A pattern is a finite string of constant and variable symbols. The langauge generated by a pattern is the set of all strings of constant symbols which can be obtained from the pattern by substituting non-empty strings for variables. We study the learnability of one-variable pattern languages in the limit with respect to the update time needed for computing a new single hypothesis and the expected total learning time taken until convergence to a correct hypothesis. Our results are as follows. First, we design a consistent and set-driven learner that, using the concept of descriptive patterns, achieves update time O(n2logn), where n is the size of the input sample. The best previously known algorithm for computing descriptive one-variable patterns requires time O(n4logn) (cf. Angluin, J. Comput. Systems Sci. 21 (1) (1980) 46-62). Second, we give a parallel version of this algorithm that requires time O(logn) and O(n3/logn) processors on an EREW-PRAM. Third, using a modified version of the sequential algorithm as a subroutine, we devise a learning algorithm for one-variable patterns whose expected total learning time is O(l2logl) provided that sample strings are drawn from the target language according to a probability distribution with expected string length l. The probability distribution must be such that strings of equal length have equal probability, but can be arbitrary otherwise. Thus, we establish the first algorithm for learning one-variable pattern languages having an expected total learning time that provably differs from the update time by a constant factor only. Finally, we show how the algorithm for descriptive one-variable patterns can be used for learning one-variable patterns with a polynomial number of superset queries with respect to the one-variable patterns as query language.
Windows NT 4.0 Troubleshooting and Configuration with Cdrom
Authors: Robert Reinstein
Venue:  (1997)

:Windows NT Troubleshooting and Configuration is an all-in-one resource on Windows NT Workstation and Server. This hands-on guide provides invaluable insight and effective techniques to make this powerful operating system work for you. With real-world advice, expert tips, configuration, and troubleshooting flowcharts, you'll have all the tools you will need to make informed decisions and resolve problems - quickly and efficiently. You'll learn how to install and configure Windows NT client software on DOS, Windows 3.x, Windows 95, and Windows NT Workstation; work with NTFS, the NT file system; use the Network Client Administrator; and successfully implement security. With Windows NT Troubleshooting and Configuration, you'll master the intricacies of this robust operating system. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Demand Adaptive and Locality Aware (DALA) streaming media server cluster architecture
Authors: Zihui Ge, Ping Ji, Prashant Shenoy
Venue: Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video (2002)

The wide availability of broadband networking technologies such as cable modems and DSL coupled with the growing popularity of the Internet has led to a dramatic increase in the availability and the use of online streaming media. With the "last mile" network bandwidth no longer a constraint, the bottleneck for video streaming has been pushed closer to the server. Streaming high quality audio and video to a myriad of clients imposes significant resource demands on the server. In this work, we propose a demand adaptive and locality aware (DALA) clustered media server architecture that can dynamically allocate resources to adapt to changing demand and also maximize the number of clients serviced by the server cluster. Moreover, our design exploits temporal locality among requests by dispatching newly arriving requests to servers that are already servicing prior requests for those objects, thereby extracting the benefits of locality. We explore the efficacy of the DALA clustered architecture using simulations. Our simulation results show that DALA is highly adaptive, exhibits significant performance gains when compared to static schemes, and has a low system overhead. Our results demonstrate that DALA is a simple, yet effective approach for designing clustered media servers.
Autonomy, local autonomy, and coherence in naming in distributed computer systems
Authors: Sanjay Radia
Venue: Proceedings of the 3rd workshop on ACM SIGOPS European workshop: Autonomy or interdependence in distributed systems? (1988)

In a distributed system, different subsystems (for example, a machine or a network) may have the need and capability for quite different degrees of autonomy; for example, a mobile machine with a large disk that occasionally connects to a distributed system would be configured to be more autonomous than a disk-less workstation that is permanently connected. We wish to understand the issues and tradeoffs in controlling the degree of autonomy.An important factor limiting autonomy in a distributed system is dependence on remote objects. However, making these objects locally available may not be sufficient. The autonomy of a subsystem with respect to its local objects may be constrained by the need for coherence (or cooperation) in the system. Coherence can occur in different forms and at different levels[8]; for example, a common protocol may be used to allow subsystems to communicate, operations may have the same semantics for local and remote objects (this is often called network transparency), global names may be used to allow names to be freely exchanged and to make sharing easier, etc. The potential conflict between autonomy and coherence was observed early in the development of distributed systems [2,8].The aim is to find mechanisms that support coherence within a system, but do not constrain the autonomous functioning of a subsystem with respect to its local objects. This would allow a choice between autonomy and dependence so that different subsystems can be configured with different degrees of dependence on remote objects and hence different degrees of autonomy.We investigate two areas. First, we take a closer look at what it means for a subsystem to be autonomous, for this has been largely neglected in the literature. We aim for a broad definition which is consistent with the general meaning of the term autonomy. Second, we investigate the conflict between autonomy and coherence in naming, and outline a solution for naming communication end-points that supports coherence without limiting the autonomy of machines and networks.
Provably authenticated group Diffie-Hellman key exchange
Authors: Emmanuel Bresson, Olivier Chevassut, David Pointcheval, Jean-Jacques Quisquater
Venue: Proceedings of the 8th ACM conference on Computer and Communications Security (2001)

Group Diffie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to provide a pool of players with a shared secret key which may later be used, for example, to achieve multicast message integrity. Over the years, several schemes have been offered. However, no formal treatment for this cryptographic problem has ever been suggested. In this paper, we present a security model for this problem and use it to precisely define AKE (with "implicit" authentication) as the fundamental goal, and the entity-authentication goal as well. We then define in this model the execution of an authenticated group Diffie-Hellman scheme and prove its security.
Excel 98 for MacIntosh, 1st edition
Authors: Maria Langer
Venue:  (1998)

:Takes an easy, visual approach to teaching Excel, using pictures to guide you through the software and show you what to do; works like a reference book - you look up what you need and then get straight to work; no long-winded passages - concise, straightforward commentary explains what you need to know; companion Web site at www.peachpit.com/vqs/excel98 gives you sample files from the book, extra tips, online resources, and more.
Probability theory for the Brier game
Authors: V. Vovk
Venue: Theoretical Computer Science (2001)

The usual theory of prediction with expert advice does not differentiate between good and bad "experts": its typical results only assert that it is possible to efficiently merge not too extensivepools of experts, no matter how good or how bad they are. On the other hand, it is natural toexpect that good experts' predictions will in some way agree with the actual outcomes (e.g., theywill be accurate on the average). In this paper we show that, in the case of the Brier predictiongame (also known as the square-loss game), the predictions of a good (in some weak andnatural sense) expert must satisfy the law of large numbers (both strong and weak) and the lawof the iterated logarithm; we also show that two good experts' predictions must be in asymtoticagreement. To help the reader's intuition, we give a Kolmogorov-complexity interpretation ofour results. Finally, we briefly discuss possible extensions of our results to more general games;the limit theorems for sequences of events in conventional probability theory correspond to thelog-loss game.
Monitoring for pornography and sexual harassment
Authors: Raymond R. Panko, Hazel Glenn Beh
Venue: Communications of the ACM (2002)

The legal basis for workplace surveillance when dealing with two particular Internet abuses.
A Few Steps Towards 3d Active Vision, 1st edition
Authors: Thierry Vieville
Venue:  (1997)

:A Few Steps Towards 3D Active Vision describes several modules that can be used to perform 3D vision. A specific problem in the field of active vision is analyzed, namely, how suitable is it to explicitly use 3D visual cues in a reactive visual task? The author has collected a set of studies on this subject and has used these experimental and theoretical developments to propose a synthetic view on the problem, completed by some specific experiments. With this book scientists and graduate students will have a complete set of methods, algorithms, and experiments to introduce 3D visual cues in active visual perception mechanisms such as autocalibration of visual sensors on robotic heads and mobile robots. Analogies with biological visual systems provide an easy introduction to this subject.
Low power storage cycle budget distribution tool support for hierarchical graphs
Authors: Erik Brockmeyer, Arnout Vandecappelle, Sven Wuytack, Francky Catthoor
Venue: Proceedings of the 13th international symposium on System synthesis (2000)

In data dominated applications, like multi-media and telecom applications, data storage and transfers are the most important factors in terms of energy consumption, area and system performance. Several steps which optimize these costs are present in our systematic Data Transfer and Storage Exploration methodology. In the important step discussed in this paper, the cycle budget available for background storage transfers is globally distributed over the application's memory accesses that are typically grouped in the loop and function hierarchy. This is crucial for meeting the real-time constraints with a customized memory organisation without counteracting the memory size and energy budget optimizations achieved by earlier steps in our script.This paper proves the effectiveness of the prototype tool on driver applications of several application domains. It clearly shows the tradeoff between power, area and speed.
America Online Simplified ,Second Edition, 2nd edition
Authors: Ruth Maran
Venue:  (2000)

:Are you new to computers? Does new technology make you nervous? Relax! You're holding in your hands the easiest guide ever to America Online 5.0  a book that skips the long-winded explanations and shows you how things work. All you have to do is open the book, follow the friendly disk character  and discover just how easy it is to get up to speed.A friendly disk character introduces each taskSelf-contained, two-page lessons make learning a snapFull-color screen shots walk you through step-by-stepUseful tips offer extra hints for each taskSimplified® "I'm 51 and a long time out of the classroom, but these books make it easier for me to learn. Hats off to you for a great product."  William K. Rodgers (Spencer, NC) "I write to extend my thanks and appreciation for your books. They are clear, easy to follow, and straight to the point. Keep up the good work!"  Seward Kollie (Dakar, Senegal)Author Biography: At maranGraphics, we believe in producing great computer booksone book at a time. Each maranGraphics book uses the award-winning communication process that we have been developing over the last 25 years. Using this process, we organize screen shots, text and illustrations in a way that makes it easy for you to learn new concepts and tasks. We spend hours deciding the best way to perform each task, so you don't have to! Our clear, easy-to-follow screen shots and instructions walk you through each task from beginning to end. Our detailed illustrations go hand-in-hand with the text to help reinforce the information. Each illustration is a labor of lovesome take up to a weekto draw! We want to thank you for purchasing what we feel are the best computer books money can buy. We hope you enjoy using this book as much as we enjoyed creating it! Sincerely, The Maran Family
Barefoot Expert: The Interface of Computerized Knowledge Systems and Indigenous Knowledge Systems
Authors: Doris M. Schoenhoff
Venue:  (1993)

:It may seem a strange match--AI and crop irrigation or AI and the Serengeti lions but researchers in Artifical Intelligence envision expert systems as a new technology for capturing the knowledge and reasoning process of experts in agriculture, wildlife management, and many other fields. These computer programs have a relevance for developing nations that desire to close the gap between themselves and the richer nations of the world. Despite the value and appeal of expert systems for economic and technological development, Schoenhoff discloses how this technology reflects the Western preoccupation with literacy and rationality. When expert systems are introduced into developing nations, they must interact with persons who reason and articulate their knowledge in ways unfamiliar to high-tech cultures. Knowledge, particularly in poor and and traditional communities, may be expressed in proverbs rather than propositions or in folklore rather than formulas. Drawing upon diverse disicplines, the author explores whether such indigenous knowledge can be incorporated into the formal language and artificial rationality of the computer-and the imperative for working toward this incorporation.
Visual FoxPro 5.0 for Windows: Developing Application Framework, with Disk
Authors: Nelson King
Venue:  (1997)

:An application framework is an object-oriented approach to building an application. It is the structure on which you hang all the pieces of an application, and it has become a standard approach for the software industry. It makes possible the creation of many applications with a minimum of effort -- provided you have a framework and know how to use it. That might mean programming one from scratch, starting with somebody elses, or piecing one together. To successfully build full-scale applications with Visual FoxPro 5.0, you need to understand application frameworks. Visual FoxPro 5.0 for Windows delivers that knowledge. Rather than just give you his own application framework, Nelson King provides the skills you need to build your own customized version. Learn through clear, easy-to-navigate examples how applications are constructed using the latest database and object-oriented tools provided by Visual FoxPro 5.0. Youll start with the underlying concepts of the application framework, and then move on to powerful techniques (including the vitally important class hierarchy). Kings emphasis is on teaching you how to do it yourself. If youre looking for a solid foundation on the art and craft of building object-oriented applications, this is your one-stop guide.
A hierarchical method for synthesizing relations
Authors: Raymond Y. Fadous
Venue: Proceedings of the 20th annual Southeast regional conference (1982)

There are two basic approaches in the normalization theory of relational databases. One approach is the decomposition of large relation schemes into smaller relation schemes. A required criteria for a satisfactory decomposition is the lossless join property. The other approach is to synthesize a set of relation schemes from a given set of functional dependencies that are assumed to hold for a universal relation scheme. The synthesized relation schemes are easily identified once a minimal cover of the given set of functional dependencies is obtained. This paper presents another method for synthesizing relation schemes without finding a minimal cover. Starting with a given set of functional dependencies, a partial order graph can be defined. Using the partial order graph and any method for finding keys of relation schemes, a systematic method for synthesizing relation schemes is outlined. The method is easy to implement. However, no programming technique is suggested in this paper.
The Emerging High-Tech Consumer: A Market Profile and Marketing Strategy Implications
Authors: Allan C. Reddy
Venue:  (1997)

:Who are the consumers of high-tech goods and services, and what will their needs and preferences be as we move into the next century? Allan Reddy and his team of marketing researchers and professionals lay out the essentials of a high-tech consumer "profile," then dig into the implications this holds for developing successful marketing strategies. They synthesize the important current research and its findings, and by taking a multi-specialist approach to their subject, they bring a variety of interlocking and essential viewpoints to bear on it. A must read for professional marketers and their academic colleagues, and a useful overview for high-tech industry strategists and planners. 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
Vc++ MFC Extensions by Example, 1st edition
Authors: John E. Swanke
Venue:  (1999)

:Microsoft Foundation Classes (MFC) is the framework of choice for 66% of Windows programmers. Learn by example how to extend MFC to create more sophisticated and powerful applications. The CD-ROM contains a working project for Visual C++ V5.0 and V6.0 for every example in the book, as well as the author's own SampleWizard utility.
UNIX to DEC-10: a simple teleprocessing link
Authors: Mukesh Sundaram
Venue: Proceedings of the 17th annual Southeast regional conference (1979)

This work is part of a thesis project for the Master of Science degree in Computer Science. The objective of the project is to create a software link between a PDP-11/34 minicomputer running under the UNIX operating system and a DEC-10, both at the University of Tennessee at Knoxville.This link provides the PDP-11 users the capability of batch job submission to the DEC-10. The hardware involved is minimal -either machine views the other as a simple terminal. The actual software that handles the communication is a simple process, not part of the operating system, per se.A special device driver routine (added to the operating system) is necessary to handle the I/O under UNIX. The existing device driver routine has a limited buffer size of 256 characters. The communication software which reads this buffer competes for machine resources with the same priority as other user processes. Therefore, a buffer overrun and consequent information loss can occur unless the output of the DEC-10 is automatically inhibited by the device driver until buffer space is available.At any time, a user of the PDP-11 can submit a file of commands to be interpreted line by line by either the DEC system or the UNIX system. This submission merely results in the request being queued as a batch process to be later initiated by an operator. When initiated by the operator, the queue of requests is serviced individually by first logging into the requesting user's DEC account (this information is system maintained). Any output produced by the DEC system is stored in a file with the entry in the user's directory. The entire implementation is in the C language. 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
Loss probability calculations and asymptotic analysis for finite buffer multiplexers
Authors: Han S. Kim, Ness B. Shroff
Venue: IEEE/ACM Transactions on Networking (TON) (2001)

In this paper, we propose an approximation for the loss probability, PL (x), in a finite buffer system with buffer size x. Our study is motivated by the case of a high-speed network where a large number of sources are expected to be multiplexed. Hence, by appealing to Central Limit Theorem type of arguments, we model the input process as a general Gaussian process. Our result is obtained by making a simple mapping from the tail probability in an infinite buffer system to the loss probability in a finite buffer system. We also provide a strong asymptotic relationship between our approximation and the actual loss probability for a fairly large class of Gaussian input processes. We derive some interesting asymptotic properties of our approximation and illustrate its effectiveness via a detailed numerical investigation.
Computer Aided Mechanical Design and Analysis, 3rd edition
Authors: V. Ramamurti
Venue:  (1998)

:This third edition of a classic reference has been revised and updated to give you cutting-edge methods that apply to such mechanical components as cranes ... hydraulic presses ... pressure vessels ... heavy duty molding boxes ... gear boxes ... steam turbine rotors ... boiler frames ... compressor disks ... gear wheels & impellers ... and circuit breakers. The highly-effective computer-aided methods outlined in this invaluable book can be applied to design a 3-roll plate bending machine ... to analyze torsional oscillations of a multicylinder engine ... to design a guillotine shear ... to analyze the transient characteristics of a bladed disk during run-up ... and much more.
Applying COM+, 1st edition
Authors: Gregory Brill
Venue:  (2000)

:Applying COM+ is a resource to help application designers, programmers and managers conceptualize the new functionality of COM+ and how it can be utilized within their enterprise systems. It goes deeper to provide much-needed insight into coding techniques for both VB and C++ developers, and when and how to make use of specific COM+ services. Unlike other books which assume little programming expertise from their readers, Applying COM+ also offers intermediate and advanced level users new tips and insights.
Object-Oriented Software Development in Java, 1st edition
Authors: Xiaoping Jia
Venue:  (1999)

:Object-Oriented Software Development Using Java: Principles, Patterns, and Frameworks focuses on developing skills in designing software, particularly in writing well-designed, medium-sized object-oriented programs. It provides a broad and coherent coverage of object-oriented technology, including object-oriented modeling using the Unified Modeling Language (UML), object-oriented design using Design Patterns, and object-oriented programming using Java.