ppxscal/embedding_network huggingface dataset:
How to Do Everything with Your Palm Handheld, 2nd edition
Authors: Dave Johnson, Rick Broida
Venue:  (2001)

:Learn to use all Palm OS handheld devices, including the Palm VII handheld, the Handspring Visor, and Qualcomm pdQ smartphone with this friendly, solutions-oriented guide. Book rights: McGraw-Hill, the publisher of this eBook, is granting readers the right to print this book as well as the right to lend/give this eBook to other Adobe Acrobat eBook Plus Reader users.Printing: Users can print eBook pages as needed. This is an especially useful feature for business people. To print, click on the menu button in the Acrobat eBook Reader and select the print option. Lending/Giving We currently have two ways to lend or give a book: you can beam it to a computer if both have infrared ports, or you can send it to a computer on your network. To lend a book to someone else, go to the Library, click a book. Click the Menu button and then click Lend/Give to display the Lend/Give dialog box. Choose a loan period or click Give. To send the book over an infrared connection, click Beam. To send the book to a computer on the network, enter the computer name in the Send To box and click Send. You can either lend the book or give it away. Like a paper book, there is only ever one working copy. Once the lending period expires, you get your rights back and you can re-read the book or lend it again. Of course, if you give it away, it's gone for good (unless the recipient gives it back). Listen to your eBooksUsers have the ability to listen to the spoken text of this book. Simply click the Read Aloud button in the Adobe eBook Reader. A control panel appears at the bottom of the display area where you can pause, continue, or stop the spoken text. Please note:This feature is only available on Windows 2000 machines.
AT2L2 o N2/2 for fast fourier transform in multilayer VLSI
Authors: Chi-Hsiang Yeh
Venue: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures (2002)

In this paper, we show that N-point fast Fourier transform (FFT) circuits with throughput 1 (i.e., time 1 after pipelining) can be optimally laid out with area N2/(4&lfloor; L2/2 &rfloor;) + o(N2/L2) under the multilayer 2-D grid model, where only one active layer (for network nodes) is required and L layers of wires are available, 2 &lte; L &lte; o(*sqrt;[3]N). We further propose AT2L2 or 2 AT2 &lfloor; L2/2 &rfloor; as a new parameter for characterizing the area-time complexity for multilayer VLSI, and show that AT2L2 &omicron; N2/2 for N-point Fourier transform.
Governance.com: Democracy in the Information Age
Authors: Elaine Ciulla Kamarck, Visions of Governance, Joseph S. Nye,  Jr.
Venue:  (2001)

:Advances in information technology are constantly transforming democratic governance. Power over information has become decentralized, fostering new types of community as well as different roles for government. This fascinating volume explores the many ways in which today's information revolution is changing our institutions of governance. The contributors illuminate many of the promises -- and the daunting challenges -- of democratic government in a rapidly changing world of networks, information, and enhanced communication. Governance.com was developed by the Visions of Governance in the 21st Century project at Harvard University's John F. Kennedy School of Government.
Arena: the Arena product family: enterprise modeling solutions
Authors: Roderick J. Swets, Glenn R. Drake
Venue: Proceedings of the 33nd conference on Winter simulation (2001)

This paper introduces the Arena suite of products for modeling, simulation, and optimization highlighting product architecture and technology features that are targeted toward successful deployment of simulation and Arena throughout an enterprise.
Digital Logic Design, 3rd edition
Authors: B. Holdworth, Brian Holdsworth
Venue:  (1994)

:The third edition of this classic student text reflects the developments that have taken place in the digital field in recent years.
Quixtar Click-by-Click, 2nd edition
Authors: Denise Reynolds, Douglas Reynolds
Venue:  (2001)

:You asked for it. Now, you've got it! Just what you needed! A complete, up-to-date guide to the QUIXTAR web site that everyone - from the newest user to the savviest web surfer - will want to have on hand. Relax and enjoy yourself as the authors of Quixtar click-by-click take you on a tour of the site that has proven to be one of the Web's brightest stars, in Quixtar click-by-click, 2nd Edition. Still in its infancy, QUIXTAR is a dot-com dream come true. True to its name QUIXTAR's skyrocketing launch drew millions of hits a day, right from the start. Since then, it continues to amaze those who follow its course. Debt-free. And profitable. Here's an e-commerce concept that anybody can love. And with good reason. QUIXTAR paid out over $143 million in cash bonuses to participating IBOs its first year. Those IBOs are regular people. Just like you. Everything you need to know about the QUIXTAR site is here, in a friendly, easy-to-understand format. No techno-mumbo-jumbo. No book too big to read. Just what you need. No more. No less. So have no fear, click-by-click is here! You'll find special sections that showcase some of the site's newest features. New stores. New navigation. New ways of doing Ditto Delivery. A new Visitors' Area. A cool multimedia presentation. And more. Much more. Of course, all your favorites are here, too. Handy tables that summarize each Partner Store's offerings - stores like OfficeMax and TrueValue Hardware - and show the points or Q-Credits you'll earn when you shop there. A listing of each of the hundreds of Catalog City stores - like J. Crew, Neiman-Marcus, and The Sharper Image - along with a description of the merchandise they carry. That information alone will save you days of surfing time! And because we know how much you love pictures, we're including screen shots for each section of the site. Membership. Registration. Ordering. Expert Advice. My Assessment. My Home. My Health. My Self. My Links. Hot Buys. And the Store For More, full of merchandise from hundreds of top-name manufacturers. Discover the Seven Types of Shoppers and determine your shopping personality. Then shop the way you want. By using the Product Index. Alphabetical Listing. Store Directory. Or Search feature. Those with a passion for shopping can browse 'til their heart's content. Use the Lingo boxes to get up to speed on unfamiliar computer terms and impress your kids with your new vocabulary. Check out the QuickTips to get insider information and shortcuts that will make you into an expert before you know it. You'll find lots of suggestions for maximizing your points or Q-Credits, too. Plus a wonderful index to help you look up the answers to specific questions you may have. All right here, in Quixtar click-by-click, 2nd Edition. The best just got better!
Internet e-mail: Protocols, Standards, and Implementation, 1st edition
Authors: Lawrence Hughes
Venue:  (1998)

:Strengthen your knowledge of the basic concepts and technical details necessary to develop, implement, or debug e-mail software with this practical new reference. Authored by a recognized expert in creating and developing successful Internet e-mail servers, the book explains the underlying technology and describes the key protocols and extensions associated with Internet e-mail, including SMTP, POP3, IMAP, MIME, DSN, and more. Network administrators, computer specialists, software developers... anyone charged with assessing, developing, or managing Internet e-mail systems will value this clear, comprehensive guide. It helps you build a sound understanding of e-mail architecture, message flow, and tracing protocols, and includes real-world examples of message exchanges with program code that you can refer to when developing or debugging your own systems. You also gain valuable insight into various security topics, including public and secret key encryption, digital signatures, and key management. What's more, each chapter begins with a unique, detailed definition list to help speed your understanding of technical terms and acronyms. CD-ROM Included! Valuable software contains a listing of related Internet RFCs, as well as RSA PKCS documents, Eudora 3.0 freeware client, and the free user version of Software.com Post.Office Server for Windows NT 3.0.
Digital Preservation and Metadata: History, Theory, Practice
Authors: Susan S. Lazinger, Helen R. Tibbo
Venue:  (2001)

:Digital preservation is no longer a problem confined to libraries, but an issue that has become the concern of companies, organizations, and individuals worldwide. Confronting the critical issues of digital preservation, Lazinger shows you how to effectively safeguard your resources -- from dealing with problems of obsolescence to responsibilities, methods of preservation, cost, and metadata formats. She also provides helpful information about national and international institutions that have established frameworks for digital libraries and archives. A long-needed guide for anyone involved in the preservation of digital information, this title is indispensable in understanding today's methods and practices, intellectual discourse, and preservation guidelines. A must for librarians, archiving professionals, faculty and students of library science, administrators, and corporate leaders!
Runge--Kutta Solutions of a Hyperbolic Conservation Law with Source Term
Authors: Mark A. Aves, David F. Griffiths, Desmond J. Higham
Venue: SIAM Journal on Scientific Computing (2000)

Spurious long-term solutions of a finite-difference method for a hyperbolic conservation law with a general nonlinear source term are studied. Results are contrasted with those that have been established for nonlinear ordinary differential equations. Various types of spurious behavior are examined, including spatially uniform equilibria that exist for arbitrarily small time-steps, nonsmooth steady states with profiles that jump between fixed levels, and solutions with oscillations that arise from nonnormality and exist only in finite precision arithmetic. It appears that spurious behavior is associated in general with insufficient spatial resolution. The potential for curbing spuriosity by using adaptivity in space or time is also considered.
Modern Compiler Design, 1st edition
Authors: Dick Grune, C. Jacobs, Koen Langendoen, Henri Bal
Venue:  (2000)

:While focusing on the essential techniques common to all language paradigms, this book provides readers with the skills required for modern compiler construction. All the major programming types (imperative, object-oriented, functional, logic, and distributed) are covered. Practical emphasis is placed on implementation and optimization techniques, which includes tools for automating compiler design.
The Power of Migration in Multiprocessor Scheduling of Real-Time Systems
Authors: Gilad Koren, Emanuel Dar, Amihood Amir
Venue: SIAM Journal on Computing (2000)

In this paper we study the performance of off-line multiprocessor real-time schedules that allow task migration compared to those that forbid migration. We consider an off-line scheduling problem in which a given collection of tasks, each with a release time, computation time, and deadline, are to be run on a multiprocessor system. A preemptive schedule allows the execution of a task to be temporarily suspended and resumed at a later time. A migrative schedule allows the task to resume on any processor whereas a nonmigrative schedule allows the task to resume only on the processor in which it was initially started. A schedule value is the summation of all the values of all the tasks that were completed by their deadlines. In this paper we assume that a task's value is proportional to its computation time. We present lower and upper bound results. For a system with n processors, we construct a nonmigrative schedule that is guaranteed to achieve at least $1-( 1-\frac 1{2n}) ^n$ of the optimal migrative schedule value. In addition, we show task sets for which even an optimal nonmigrative schedule achieves at most n/(2n-1) of the optimal migrative value. Asymptotically (as $n\rightarrow \infty $) our upper bound approaches 1/2 and the lower bound approaches $1 - {1\over \sqrt{e}} \sim 0.3935$.
Link layer assisted mobile IP fast handoff method over wireless LAN networks
Authors: Hidetoshi Yokota, Akira Idoue, Toru Hasegawa, Toshihiko Kato
Venue: Proceedings of the 8th annual international conference on Mobile computing and networking (2002)

The growing popularity of IEEE 802.11 has made wireless LAN a potential candidate technology for providing high speed wireless access services. Also, by supporting Mobile IP, wireless LAN can meet demands for expanded wireless access coverage while maintaining continuous connectivity from one wireless LAN to another. In the Mobile IP procedure, mobile node movement can be detected from advertisements of foreign agents that differ from the previously received advertisement and the new "care-of" address is registered with the home agent. However, user packets are not forwarded to the new foreign agent until registration is completed and this interruption may degrade the quality of service especially in real-time applications such as audio and video or may lower the TCP throughput due to retransmission timeout. To tackle these issues, we propose a new low latency handoff method, where access points used in a wireless LAN environment and a dedicated MAC bridge are jointly used to alleviate packet loss without altering the Mobile IP specifications. In this paper, we present the design architecture of the proposed method and evaluate its performance in an actual network environment to verify the effectiveness of our approach.
Illustrated AutoCAD Quick Reference: Release 13 for DOS, 1st edition
Authors: Ralph Grabowski, Phyllis B. Miller, James E. Fuller
Venue:  (1994)

:This quick reference provides direct information on all commands and functions for easy access and use as a desk reference tool. Great resource for professional AutoCAD users.
Street Fighter Alpha 3: Official Fighting Guide
Authors: Kevin Melloy, Ken Schmidt
Venue:  (2000)

:BradyGAMES-Street Fighter: Alpha 3 Official Strategy Guide Features. Move Lists for every character. Devasting Combos for each fighter  plus, tips on how to make your own. Bonus Coverage of new World Tour Mode from Sega Dreamcast!
On Binary Searching with Nonuniform Costs
Authors: Eduardo S. Laber, Ruy L. Milidiú, Artur A. Pessoa
Venue: SIAM Journal on Computing (2002)

Let us consider an ordered vector A[1:n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true in both the average and worst case. However, if the costs are nonuniform, then the best strategy is not necessarily the standard binary search. The best algorithm to construct a strategy that minimizes the expected search cost runs in O(n3) time and requires O(n2) space. The same complexities hold for the best algorithm to construct a strategy that minimizes the worst case search cost.Here, we show how to efficiently construct search strategies that are at most at a constant factor from the optimal one. These constructions take linear time and use only linear space. For both the problem of minimizing the expected search cost, under uniform access probabilities, and the problem of minimizing the worst case search cost, we present algorithms that require O(n) space and give a $(2+\epsilon+o(1))$-approximated solution in O(n) time for any fixed value of $\epsilon > 0$.
Windows 98 Answers! Certified Tech Support, 1st edition
Authors: Martin S. Matthews, Carole Boggs Matthews
Venue:  (1998)

:Save time and money! Technical support at your fingertips! Discover hundreds of easy-to-find answers to questions from installation and customization to setting up your network. Endorsed by Stream International -- world's leading support firm! BONUS! Instantly see how to perform the most important functions with the tearout instant answers card.
Computer graphics: whence and hence
Authors: Jackie S. Potts
Venue: Proceedings of the 1st annual conference on Computer graphics and interactive techniques (1974)

One of the most important, far-reaching, sophisticated, and glamorous endeavors of the computer field is computer graphics. It reaches into the major computer areas of input, output, programming and debugging. It can be useful to every discipline that employs to advantage the computer. From whence came this powerful tool? What is is? What is its future? Answers to these questions are included in the scope of this article. It divides computer graphics into two main divisions - passive and interactive. The passive division includes microfilm recorders, ink pen recorders, plotters, and printers. Under the interactive division are grouped computer animation and computer-generated movies. This survey article considers the history of all the major groups of computer graphics: a discussion of the typical hardware of each; and a section on computer-aided design as well as one on computer graphics professional groups and societies, In the appendicies are a comprehensive glossary of computer graphics terminology and a bibliography of over 650 items.
Making Hard Decisions with Decisiontools Suite, 1st edition
Authors: Robert T. Clemen, Terence Reilly
Venue:  (1999)

:MAKING HARD DECISIONS WITH DECISIONTOOLS« is a special version of Bob Clemen's best-selling text, MAKING HARD DECISIONS. This straight-forward book teaches the fundamental ideas of decision analysis, without an overly technical explanation of the mathematics used in management science. This new version incorporates and implements the powerful DecisionTools« by Palisade Corporation, the world's leading toolkit for risk and decision analysis. At the end of each chapter, topics are illustrated with step-by-step instructions for DecisionTools«. This new version makes the text more useful and relevant to students to business and engineering.
Countering the New Terrorism
Authors: Ian Lesser, John Arquilla, Bruce Hoffman, David Ronfeldt, Michele Zanini
Venue:  (1999)

:Terrorism is changing, as is its effect on national security. This book brings together three complementary papers that address trends in international terrorism, the special problem of terrorism in the information age, and how to meet the terrorist challenge to U.S. interests. Each of these papers pays special attention to the effect of terrorism on the U.S. military. Each also considers the role of military forces, especially air and space power, in national counterterrorism strategy. The study made extensive use of the RAND-St. Andrews Chronology of International Terrorism a comprehensive database on world wide terrorist incidents since 1968. The papers were written as contributions to a year-long project on Terrorism and Counterterrorism: Implications for Strategy and USAF Planning, conducted within the Strategy and Doctrine Program of RAND's Project AIR FORCE. The study was co-sponsored by the Deputy Chief of Staff, Air and Space Operations (AF/XO), and the Director of Intelligence, Surveillance, and Reconnaissance (AF/XOI). It was aimed at helping the Air Force to address its own force protection concerns, as well as contributing to the broader national and international debate on terrorism. The findings should be of interest to a wide audience interested in terrorism, counterterrorism, and national security policy.
Evaluating software architectures by coloured petri nets
Authors: Kimiyuki Fukuzawa, Motoshi Saeki
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

The quality of an architectural design of a software system has a great influence on achieving non-functional requirements to the system. In this paper, we present a technique for describing behavioral aspects of software architectures formally based on Coloured Petri Nets (CPNs) and a technique for evaluating their non-functional qualities by analyzing CPNs with a supporting tool. We provide quality models for evaluating security, efficiency and reliability, and integrate them with CPN descriptions of software architectures. Their qualities are evaluated by simulating the CPNs on CPN analysis tool called Design/CPN. To show the effectiveness of our techniques, we illustrate Applet architecture and CGI one in a web computing application, and evaluate their quality of security on network, of time-efficiency and of reliability on network by using Design/CPN. It allows us to clarify trade-off on issues of selecting which architecture should be selected.
Models in information retrieval
Authors: Norbert Fuhr
Venue: Lectures on information retrieval (2001)

Retrieval models form the theoretical basis for computing the answer to a query. They differ not only in the syntax and expressiveness of the query language, but also in the representation of the documents. Following Rijsbergen's approach of regarding IR as uncertain inference, we can distinguish models according to the expressiveness of the underlying logic and the way uncertainty is handled. Classical retrieval models are based on propositional logic. In the vector space model, documents and queries are represented as vectors in a vector space spanned by the index terms, and uncertainty is modelled by considering geometric similarity. Probabilistic models make assumptions about the distribution of terms in relevant and nonrelevant documents in order to estimate the probability of relevance of a document for a query. Language models compute the probability that the query is generated from a document. All these models can be interpreted within a framework that is based on a probabilistic concept space. For IR applications dealing not only with texts, but also with multimedia or factual data, propositional logic is not sufficient. Therefore, advanced IR models use restricted forms of predicate logic as basis. Terminological/description logics are rooted in semantic networks and terminological languages like e.g. KL-ONE. Datalog uses function-free horn clauses. Probabilistic versions of both approaches are able to cope with the intrinsic uncertainty of IR.
Listing all potential maximal cliques of a graph
Authors: Vincent Bouchitté, Ioan Todinca
Venue: Theoretical Computer Science (2002)

A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal triangulation of that graph. It is known that if these objects can be listed in polynomial time for a class of graphs, the treewidth and the minimum fill-in are polynomially tractable for these graphs. We show here that the potential maximal cliques of a graph can be generated in polynomial time in the number of minimal separators of the graph. Thus, the treewidth and the minimum fill-in are polynomially tractable for all classes of graphs with a polynomial number of minimal separators.
XML in Plain English, Second Edition, 2nd edition
Authors: Sandra E. Eddy, B. K. Delong, Timothy Eden
Venue:  (2000)

:XML in Plain English: If you know what you want to do but can't remember how to do it, just browse through this thumbnail list of tasks. XML A to Z: If you don't know where to look for a production in the book, check this index. XML Syntax: If you know the production's name but don't know how to use it, you'll find its complete syntax and attributes, examples, usage notes, and related productions in this section. Cascading Style Sheets and DSSSL-O: For a complete reference of cascading style sheets and DSSSL-O, complete with syntax, examples, usage notes, and related styles, go straight to these bonus chapters.