ppxscal/embedding_network huggingface dataset:
Predicting the cost-quality trade-off for information retrieval queries: facilitating database design and query optimization
Authors: Henk Ernst Blok, Djoerd Hiemstra, Sunil Choenni, Franciska de Jong, Henk M. Blanken, Peter M.G. Apers
Venue: Proceedings of the tenth international conference on Information and knowledge management (2001)

Efficient, flexible, and scalable integration of full text information retrieval (IR) in a DBMS is not a trivial case. This holds in particular for query optimization in such a context. To facilitate the bulk-oriented behavior of database query processing, a priori knowledge of how to limit the data efficiently prior to query evaluation is very valuable at optimization time. The usually imprecise nature of IR querying provides an extra opportunity to limit the data by a trade-off with the quality of the answer. In this paper we present a mathematically derived model to predict the quality implications of neglecting information before query execution. In particular we investigate the possibility to predict the retrieval quality for a document collection for which no training information is available, which is usually the case in practice. Instead, we construct a model that can be trained on other document collections for which the necessary quality information is available, or can be obtained quite easily. We validate our model for several document collections and present the experimental results. These results show that our model performs quite well, even for the case were we did not train it on the test collection itself.
Effective service for remote computing users
Authors: A. Faye Borthick
Venue: Proceedings of the 14th annual Southeast regional conference (1976)

In recent years, a growing number of computing users have experienced the effects of the replacement of their local computing facilities with remote computing facilities. Unfortunately, remote computing may imply remoteness not only in the sense of distance but also in the senses of accessibility, control, compatibility, and responsiveness. The providers of computing service at the central site may be oblivious to these issues, but if remote users view any of these aspects of the service as unsatisfactory, effective service is thereby undermined.This paper addresses problems which arise as the result of the installation of remote computing service for users who had heretofore had access to local service. It is written from the point of view of management at the central site providing remote computing service in the hope that recognition of the problems of providing such service will be a step in the direction of solving them.
Proceedings of the 14th annual ACM symposium on User interface software and technology
Venue: Symposium on User Interface Software and Technology (2001)

UIST is the premier forum on innovative engineering of the human-computer interface. The symposium brings together user-interface researchers and practitioners with an interest in techniques, tools, and technology for constructing quality, innovative user interfaces. UIST grew out of a series of SIGGRAPH-supported workshops on User Interface Management Systems (UIMS).
Designing Web Multimedia: With Cdrom
Authors: David Miller
Venue:  (1996)

:Web Multimedia Development provides step-by-step tutorials that detail professional design and implementation of the latest Web-based multimedia techniques - from easy-to-implement multimedia enhancements to more advanced script-based media. Key components of Web design - GIF animation, Java applets, Shockwave files, audio broadcasts, and QuickTime movies - are all covered in thorough detail with emphasis on using them to create effective Web sites. 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
Microsoft Outlook 2000 Quick Source Guide
Authors: CORPORATE Quick Source Staff
Venue:  (1999)

:This 6 page, tri-fold full-color guide is an invaluable resource for anyone who uses Outlook 2000! It provides step by step instructions on how to send and receive e-mail, setup the Contacts list, use the Calendar for keeping track of appointments, and much more. An excellent instructional tool for a user new to Outlook, it also serves as a handy reference tool for the more experienced user. 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
Dealers of Lightning: Xerox PARC and the Dawn of the Computer Age
Authors: Michael A. Hiltzik
Venue:  (2000)

:Dealers of Lightning is the riveting story of the legendary Xerox PARC  a collection of eccentric young inventors brought together by Xerox Corporation at a facility in Palo Alto, California, during the mind-blowing intellectual ferment of the seventies and eighties. Here for the first time Michael Hiltzik, a correspondent for the Los Angeles Times, reveals in piercing detail the true story of the extraordinary group that aimed to bring about a technological dawn that would change the world  and succeeded. Based on extensive interviews with the scientists, engineers, administrators, and corporate executives who lived the story, Dealers of Lightning takes the read on a journey from PARC's beginnings in a dusty, abandoned building at the edge of the Stanford University campus to its triumph as a hothouse of ideas that spawned not only the first personal computer, but the windows-style graphical user interface, the laser printer, much of the indispensable technology of the Internet, and a great deal more. It shows how and why Xerox, despite its willingness to grant PARC unlimited funding and the responsibility for developing breakthroughs to keep the corporation on the cutting edge of office technology, remained forever unable to grasp (and, consequently, exploit) the innovations that PARC delivered  and it details the increasing frustration of the original PARC scientists, many of whom would go on to build their fortunes upon the very ideas Xerox so rashly discarded. More than just a riveting historical narrative, Dealers of Lightning brings to life an unforgettable cast of characters. Among them: Bob Taylor  the preacher's son from rural Texas who would be considered a prophet by some and a cantankerous egomaniac by others, whose fearless (and feared) leadership of a team of computer renegades made them the heroes of the embryonic Silicon Valley; Jack Goldman  the Xerox chief scientist who convinced the stolid corporation to stake tens of millions of dollars on PARC while warning that the investment might not pay off for years  if it paid off at all; Alan Kay  PARC's creative and philosophical soul, who suffered years of ridicule for envisioning a computer that could be tucked under the arm yet would contain the power to store books, symphonies, letters, poems, and drawings  until he arrived at Palo Alto and met the people who would build it; and Steve Jobs  who, aided by Xerox's indifference to PARC's most momentous inventions, staged a daring raid to obtain the technology that would end up at the heart of the Macintosh: the machine that for a time helped Apple dominate an explosive new market. Dealers of Lightning is an unprecedented look at the ideas, the inventions, and the individuals that propelled Xerox PARC to the frontier of technohistory  and the corporate machinations that almost prevented it from achieving greatness.
Algorithms for energy optimization using processor instructions
Authors: Anil Seth, Ravindra B. Keskar, R. Venugopal
Venue: Proceedings of the 2001 international conference on Compilers, architecture, and synthesis for embedded systems (2001)

In this paper, we consider processors which provide an idle instruction to the user for powering down processor units which are not required during portions of program execution. We describe algorithms which can be implemented in an energy-aware compiler to make efficient use of such an instruction. These algorithms are based on program static analysis and a combinatorial optimization formulation of the problem. We assume as input an assembly language program of the processor in question. The problem is to insert the idle instruction at different places in the assembly language program such that energy saving is maximized and the execution time of the resulting program is not increased beyond a user-specified value.
The importance of forcing and tree search in Qubic
Authors: Sherman F. Butler, Robert G. Schlee
Venue: Proceedings of the 14th annual Southeast regional conference (1976)

Qubic, also called three dimensional Tic-Tac-Toe, provides a good environment for developing and testing different concepts of heuristic programming and game theory. Because Qubic is a simple game one can minimize the task of learning the rules of the game as one must do in Chess or another more complex game; however, one should realize that Qubic is not a trivial game. It is not known if the person who moves first can win every game (has a win strategy) or tie every game (has a draw strategy). Citrenbaum [in 1] claims that a draw strategy exists for the game while Gammill [1] claims that a win strategy exists. The current knowledge about Qubic supports both sides. This paper proposes a solution to the game by combining the two procedures of forcing and tree search into a single strategy.
Gr&ouml;bner bases in orders of algebraic number fields
Authors: David Andrew Smith
Venue: Journal of Symbolic Computation (2002)

We prove that any order O of any algebraic number field K is a reduction ring. Rather than showing the axioms for a reduction ring hold, we start from scratch by well-ordering O, defining a division algorithm, and demonstrating how to use it in a Buchberger algorithm which computes a Grbner basis given a finite generating set for an ideal. It is shown that our theory of Grbner bases is equivalent to the ideal membership problem and in fact, a total of eight characterizations are given for a Grbner basis. Additional conclusions and questions for further investigation are revealed at the end of the paper. Copyright 2002 Academic Press
Design and implementation of a flexible RBAC-service in an object-oriented scripting language
Authors: Gustaf Neumann, Mark Strembeck
Venue: Proceedings of the 8th ACM conference on Computer and Communications Security (2001)

In this paper we present the design and implementation of the xorbac component that provides a flexible RBAC service. The xorbac, implementation conforms to level 4a of the unified NIST model for RBAC and can be reused for arbitrary applications on Unix or Windows with a C or Tcl linkage. xorbac runtime elements can be serialized and recreated from RDF data models conforming to a well-defined RDF schema. Furthermore we present our experiences with xorbac for the deployment within the HTTP environment for a web-based mobile code system.
C++ Black Book
Authors: Steven Holzner
Venue:  (2000)

:Written to give the reader the knowledge to master C++, from the basics to the most advanced material and include a Windows programming primer. A complete C++ reference and designed to work with all C++ compilers, this book is more comprehensive than any other book on C++ available today. Technically accurate and up-to-date, this book is designed to remain current without substantial updates for years. Illustrated with at least one example for every topic covered making it easier to learn the programming language.
Case study: parallel lagrangian visualization applied to natural convective flows
Authors: L. M. de la Cruz, I. García, V. Godoy, E. Ramos
Venue: Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics (2001)

This paper presents a visualization technique based on particle tracking. The technique consists in defining a set of points distributed on a closed surface and follow the surface deformations as the velocity field changes in time. Deformations of the surface contains information about dynamics of the flow; in particular, it is possible to identify zones where flow stretching and foldings occur. Because the points on the surface are independent each other, it is possible to calculate the trajectory of each point concurrently. Two parallel algorithms are studied; the first one for a shared memory Origin 2000 supercomputer and the second one for a distributed memory PC cluster. The technique is applied to a fluid moving by natural convection inside a cubic container.
Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems
Authors: Vincenzo Auletta, Sajal K. Das, Amelia De Vivo, M. Cristina Pinotti, Vittorio Scarano
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

In this paper, we study efficient strategies for mapping onto parallel memory systemscomplete trees that are accessed by fixed templates (like complete subtrees, paths, or any combinations their of). These mappings are evaluated with respect to the following criteria: 1) the largest number of data items that can be accessed in parallel without memory conflicts; 2) the number of memory conflicts that can occur when accessing templates of size equal to the number of available memory modules, thereby exploiting the full parallelism of the system; 3) the complexity of the memory addressing scheme, i.e., the cost of retrieving the module where a given data item is mapped. We show that there exist trade-offs between these three criteria and the performance of different mapping strategies depends on the emphasis given on each of these criteria. More specifically, we describe an algorithm for mapping complete binary trees of height H onto M memory modules and prove that it achieves the following performance results: 1) conflict-free access to complete subtrees of size K and paths of size N such that N+K-\lceil\log K\rceil \leq M; 2) at most 1 conflict in accessing complete subtrees and paths of size M; 3) O\left({K\over M} + c\right) conflicts when accessing a composite template of K nodes consisting of c disjoint subsets, each subset being a complete subtree, or a path or a set of consecutive nodes in a level of the tree. Furthermore, we show that an existing mapping algorithm results in a larger number, namely O\left({K\over{\sqrt{M\log M}}} + c\right), of conflicts when accessing a composite template. However, such an algorithm maps each single node in O(1) time, while the new algorithm requires O(H/N-\log K) time.
MW ClarisWorks 3.0 Companion, 3rd edition
Authors: Steven A. Schwartz
Venue:  (1995)

:The ClarisWorks all-in-one suite of word processing, spreadsheet, database, and graphics programs is about as easy to use as software gets. Even so, when you want to try out something new -- like combining spreadsheet and database information along graphics into a single, comprehensive word processing document -- you may need a smart, understandable companion. Macworld ClarisWorks 3.0 Companion, 3rd Edition, is just the ticket. In this illustrated, well-organized volume, you'll find solutions to whatever challenge crops up as you use ClarisWorks. Computer book author and columnist Steven Schwartz shows you everything you need to... Get up to speed quickly with all of ClarisWorks' modules and functions Take advantage of features such as Assistants, Document Summary, and Automatic Macros Use ClarisWorks as an able partner in your business Produce professional-looking reports for business or school Best of all, with its task-oriented format, Macworld ClarisWorks 3.0 Companion, 3rd Edition, makes it easy to find out how to use ClarisWorks to do what you want to do. Plus, the handy Quick Reference Card included with Macworld ClarisWorks 3.0 Companion, 3rd Edition, ensures that you'll never have to waste time looking up what shortcut key does what.
A model of multimedia information retrieval
Authors: Carlo Meghini, Fabrizio Sebastiani, Umberto Straccia
Venue: Journal of the ACM (JACM) (2001)

Research on multimedia information retrieval (MIR) has recently witnessed a booming interest. A prominent feature of this research trend is its simultaneous but independent materialization within several fields of computer science. The resulting richness of paradigms, methods and systems may, on the long run, result in a fragmentation of efforts and slow down progress. The primary goal of this study is to promote an integration of methods and techniques for MIR by contributing a conceptual model that encompasses in a unified and coherent perspective the many efforts that are being produced under the label of MIR. The model offers a retrieval capability that spans two media, text and images, but also several dimensions: form, content and structure. In this way, it reconciles similarity-based methods with semantics-based ones, providing the guidelines for the design of systems that are able to provide a generalized multimedia retrieval service, in which the existing forms of retrieval not only coexist, but can be combined in any desired manner. The model is formulated in terms of a fuzzy description logic, which plays a twofold role: (1) it directly models semantics-based retrieval, and (2) it offers an ideal framework for the integration of the multimedia and multidimensional aspects of retrieval mentioned above. The model also accounts for relevance feedback in both text and image retrieval, integrating known techniques for taking into account user judgments. The implementation of the model is addressed by presenting a decomposition technique that reduces query evaluation to the processing of simpler requests, each of which can be solved by means of widely known methods for text and image retrieval, and semantic processing. A prototype for multidimensional image retrieval is presented that shows this decomposition technique at work in a significant case.
Events in security protocols
Authors: Federico Crazzolara, Glynn Winskel
Venue: Proceedings of the 8th ACM conference on Computer and Communications Security (2001)

The events of a security protocol and their causal dependency can play an important role in the analysis of security properties. This insight underlies both strand spaces and the inductive method. But neither of these approaches builds up the events of a protocol in a compositional way, so that there is an informal spring from the protocol to its model. By broadening the models to certain kinds of Petri nets, a restricted form of contextual nets, a compositional event-based semantics is given to an economical, but expressive, language for describing security protocols; so the events and dependency of a wide range of protocols are determined once and for all. The net semantics is formally related to a transition semantics, strand spaces and inductive rules, as well as trace languages and event structures, so unifying a range of approaches, as well as providing conditions under which particular, more limited, models are adequate for the analysis of protocols. The net semantics allows the derivation of general properties and proof principles which are demonstrated in establishing an authentication property, following a diagrammatic style of proof.
Analyzing Broadband Networks, 2nd edition
Authors: Mark Miller
Venue:  (1996)

:Analyzing Broadband Networks, Second Edition is an invaluable reference for network designers, managers, and administrators who implement, or are planning to implement, ISDN, Frame Relay, SMDS, or ATM technologies. Packed with illustrations, case studies and helpful examples, this book provides the techniques and information you need to successfully deploy these broadband solutions. Integrated Services Digital Network (ISDN), Frame Relay, Switched Multimegabit Data Service (SMDS) and Asynchronous Transfer Mode (ATM) solve the bandwidth challenge posed by new desktop and multimedia application, the growing numbers of LAN segments, and the need to interconnect distributed systems. The book describes the design of each of these technologies and how they operate within LAN and WAN environments. Analyzing Broadband Networks, Second Edition includes an entirely new section on ISDN architecture, protocols, and analysis, in addition to updates on the operation and protocols of the latest frame relay and ATM technologies, plus interworking between various technologies, such as frame relay and ATM. Twenty case studies, illustrated using protocol analyzer traces, are featured which demonstrate the network protocols in operation along with typical failures. You will discover the optimum application for each of the four broadband technologies, and learn how to manage the networks that employ them.
Restructuring of APL functions
Authors: Amauri A. Arroyo
Venue: Proceedings of the 16th annual Southeast regional conference (1978)

The philosophy and style that has come to be known as "structured programmlng" emphasizes great concern with the manner in which a program is organized [1]. It implies that some program constructions are more effective than others, even though both might yield identical results. In many software applications, human efficiency (which might be related to such things as the ability to read, alter and understand programs) is more important than computer efficiency (which includes less memory space and/or execution time).In APL, branching is generally used within a defined function to direct the execution of commands. It is denoted by the symbol &rarr; followed by an expression E: &rarr;E. Since the value of E, the expression to the right of the branch arrow, may be scalar or vector, the form the branch command takes is a function of the ability of the programmer. A suitable standard form for the branch command is desirable and feasible.For the purposes of this discussion, the "branch to specified line number or execute next line": form of the branch command is selected as the standard form. It is entirely feasible to perform branch standardization automatically and still preserve the meaning of the original function. This paper describes such an approach.
NetScape Visual Javascript for Dummies (with CD-ROM), 1st edition
Authors: Emily A. Vander Veer
Venue:  (1998)

:The Web -- it's not just for Webmasters anymore! You can now design, implement, and test your very own client- and server-based Web applications by using Visual JavaScript -- even if you've never programmed before. Netscape Visual JavaScript For Dummies shows you how to snap together predefined components to create anything from a simple Web page to a powerful intranet application. Inside, find helpful advice on how to Create exciting, effective Web pages visually Snap together prebuilt database and communications components to produce powerful, distributed Web applications Experiment with, debug, and publish your Web site easily Design your own reusable components Take advantage of the latest JavaScript features available in Netscape Navigator 4.0 and Netscape Enterprise Server 3.0 Use the design tips and example code to jump-start your Web development efforts
Bots: The Origin of New Species
Authors: Andrew Leonard
Venue:  (1998)

:Bots is the story of cyberspace's first indigenous species. These bots - mere strings of code - are now poised to change our lives. They are as close to us as the nearest computer. They live autonomously on the Net as stand-ins for our drives and desires. They collect things for us. They correct things for us. They do what we want them to do. They do what we don't want them to do. Andrew Leonard recounts the saga of these software robots in all its quirkiness: from the trials and tribulations of artificial intelligence to the hilarious lifestyles of the first bots and the havoc they set in motion.
Dynamic HTML for Dummies, 2nd edition
Authors: Michael Hyman
Venue:  (1998)

:Web authoring has come a long way, and Dynamic HTML is the latest innovation, built in to the newest versions of Microsoft Internet Explorer and Netscape Navigator. With Dynamic HTML, For Dummies, 2nd Edition, expert author Michael Hyman shows how you can easily take your Web pages to the next level, with far more interactivity and sophistication than previously possible.