ppxscal/embedding_network huggingface dataset:
Ado 2.6, Programmer's Reference
Authors: David Sussman
Venue:  (2000)

:This book is a reference guide for the ADO programmer; it's primarily aimed at demonstrating and explaining the features of ADO 2.1 and the ways that they can be used. As such, it isn't a beginner's guide - though if you have programmed any data-access applications in the past, you'll be able to use it to get up-to-speed with ADO. In particular, the book is aimed at application developers who already use Microsoft's data access methods in their applications, but want to take full advantage of the new features of ADO 2.5 and 2.6. It includes all the information required for any reasonably experienced developer to start using ADO within their Web pages and distributed applications. Finally, it is ideal for existing ADO users, to bring them quickly up-to-date with version 2.6.
Computer Concepts Basics
Authors: Delores Wells Pusins, Ann Ambrose
Venue:  (2000)

:Offering a basic introduction to computers, this text covers computer hardware, software, applications skills, keyboarding skills, the Internet and Web page Creation, networking, careers, computer ethics and more.
Sharp L2-Error Estimates and Superconvergence of Mixed Finite Element Methods for Non-Fickian Flows in Porous Media
Authors: Richard E. Ewing, Yanping Lin
Venue: SIAM Journal on Numerical Analysis (2002)

A sharper L2-error estimate is obtained for the non-Fickian flow of fluid in porous media by means of a mixed Ritz--Volterra projection instead of the mixed Ritz projection used in [R. E. Ewing, Y. Lin, and J. Wang, Acta Math. Univ. Comenian. ( N.S.), 70 (2001), pp. 75--84]. Moreover, local L2 superconvergence for the velocity along the Gauss lines and for the pressure at the Gauss points is derived for the mixed finite element method via the Ritz--Volterra projection, and global L2 superconvergence for the velocity and the pressure is also investigated by virtue of an interpolation postprocessing technique. On the basis of the superconvergence estimates, some useful a posteriori error estimators are presented for this mixed finite element method.
Brief Microsoft Office Professional 2000, 1st edition
Authors: Maryann M. Barber, Robert T. Grauer
Venue:  (1999)

:All books in this series offer consistent presentationcommon design, pedagogy, and writing style. Concepts as well as key-strokes are stressed. Hands-on exercises in every lesson provide just the right amount of practice time. MOUS Certification throughout the expert level for all individual applications and Office 2000. Three levels of chapter-ending exercises, multiple choice, practice, and case studies. For anyone interested in becoming more proficient in Microsoft Office 2000.
Microsoft SQL Server 7.0 Administrator's Companion, 1st edition
Authors: John W. Fronckowiak, Edward L. Whalen, Marcilina S. Garcia
Venue:  (1999)

:Get the authoritative information you need to plan, install, and administer Microsoft's powerfully scalable database management system with this ADMINISTRATOR'S COMPANION. This one-volume reference provides ready answers and advice, including instructive examples, sequential procedures, and troubleshooting tips-plus a 120-day evaluation copy of SQL Server 7.0-for results on the job. Coverage Includes: System specifics-understanding SQL Server 7.0 architecture, requirements, and features such as SQL Server Manager, Enterprise Manager, and Microsoft Cluster Server Installation and setup-tutorials and guides to local and remote installations and upgrades Maximizing everyday performance-working with Transact-SQL, data retrieval, tables, indexes, views, and SQL Server Agent Optimizing server-side features-rules, constraints, defaults, stored procedures, and replication Maintenance and troubleshooting-backup/recovery, user and security management, query optimization, and common performance issues Scalability-using distributed transactions to deploy mission-critical processes with DTC (Distributed Transaction Coordinator) and MTS (Microsoft Transaction Server)
A theory of data dependencies over relational expressions
Authors: Marco A. Casanova
Venue: Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems (1982)

A formal system is developed for reasoning about a class of dependencies that includes all classes considered in the literature. The usefulness of the system is illustrated by applying it to various database design problems. The system is shown to be sound and complete by adapting the analytic tableaux method of first-order predicate calculus to the class of dependencies adopted. Finally, the method is shown to be a decision procedure for the inference problem of a subclass of the dependencies considered.
Four suggestions and a rule concerning the application of ILP
Authors: Ashwin Srinivasan
Venue: Relational Data Mining (2001)

Since the late 1980s there has been a sustained research effort directed at investigating the application of Inductive Logic Programming (ILP) to problems in biology and chemistry. This essay is a personal view of some interesting issues that have arisen during my involvement in this enterprise. Many of the concerns of the broader field of Knowledge Discovery in Databases manifest themselves during the application of ILP to analyse bio-chemical data. Addressing them in this microcosm has given me some directions on the wider application of ILP, and I present these here in the form of four suggestions and one rule. Readers are invited to consider them in the context of a hypothetical Recommended Codes and Practices for the application of ILP.
Writing for New Media; The Essential Guide to Writing for Interactive Media, Cdrom, and the Web, 1st edition
Authors: Andrew Bonime, Ken C. Pohlmann
Venue:  (1997)

:The market in new media is booming, and writers are scrambling to take advantage of the creative and commercial possibilities of this digital bonanza. Written for anyone who wants to write for new media, this unique guide quickly gets readers up to speed with all the knowledge and skills they need to write for all forms of digital media, including multimedia CD-ROMs, Web pages, and on-line magazines. And it does so in down-to-earth, non-technical language that even computer novices will understand. It also gives aspiring writers expert advice on how to break into this fast-growing field.
An A Priori Error Analysis of the Local Discontinuous Galerkin Method for Elliptic Problems
Authors: Paul Castillo, Bernardo Cockburn
Venue: SIAM Journal on Numerical Analysis (2000)

In this paper, we present the first a priori error analysis for the local discontinuous Galerkin (LDG) method for a model elliptic problem. For arbitrary meshes with hanging nodes and elements of various shapes, we show that, for stabilization parameters of order one, the L2-norm of the gradient and the L2-norm of the potential are of order k and k+1/2, respectively, when polynomials of total degree at least k are used; if stabilization parameters of order h-1 are taken, the order of convergence of the potential increases to k+1. The optimality of these theoretical results is tested in a series of numerical experiments on two dimensional domains.
Optimal Worst Case Formulas Comparing Cache Memory Associativity
Authors: Hakan Lennerstad, Lars Lundberg
Venue: SIAM Journal on Computing (2000)

In this paper we derive a worst case formula comparing the number of cache hits for two different cache memories. From this various other bounds for cache memory performance may be derived. Consider an arbitrary program P which is to be executed on a computer with two alternative cache memories. The first cache is set-associative or direct-mapped. It has k sets and u blocks in each set; this is called a (k,u)-cache. The other is a fully associative cache with q blocks---a (1,q)-cache.We derive an explicit formula for the ratio of the number of cache hits h(P,k,u) for a (k,u)-cache compared to a (1,q)-cache for a worst case program P. We assume that the mappings of the program variables to the cache blocks are optimal.The formula quantifies the ratio $$ \inf_P \frac{h(P,k,u)}{h(P,1,q)}, $$ where the infimum is taken over all programs P with n variables. The formula is a function of the parameters n,k,u, and q only. Note that the quantity $h(P,k,u)$ is NP-hard.We assume the commonly used LRU (least recently used) replacement policy, that each variable can be stored in one memory block, and that each variable is free to be mapped to any set.Since the bound is decreasing in the parameter n, it is an optimal bound for all programs with at most n variables. The formula for cache hits allows us to derive optimal bounds comparing the access times for cache memories. The formula also gives bounds (these are not optimal, however) for any other replacement policy, for direct-mapped versus set-associative caches, and for programs with variables larger than the cache memory blocks.
Easy Microsoft Word 2000
Authors: Heidi Steele
Venue:  (1999)

:Easy Microsoft Word 2000 covers the new features of Word that make learning the application a breeze for beginners. The book covers changed and improved features in Word 2000 that affect how new users navigate and find features. Toolbars, dialog boxes and open document windows have new buttons designed to make beginners learn the program more efficiently. Easy Microsoft Word 2000 orients new users quickly and efficiently to new features such as adaptive menus, document Window taskbars, using upgraded help, new Office clipboard functions, basic changes in dialog boxes,and navigation and editing features.
Local Lagrange interpolation by bivariate C1 cubic splines
Authors: Günther Nürnberger, Larry L. Schumaker, Frank Zeilfelder
Venue: Mathematical Methods for Curves and Surfaces: Oslo 2000 (2001)

Lagragne interpolation schemes are constructed based on C1 cubic splines on certain triangulations obtained from checkerboard quadrangulations.
The Business Internet and Intranets: A Manager's Guide to Key Terms and Concepts
Authors: Peter G. Keen, Tracy Torregrossa, Walid Mougayar
Venue:  (1998)

:Peter Keen delivers another comprehensive guide for managers, bringing clarity to the muddled vocabularies of the Internet and intranets. "A useful, lucid explanation of how to use the Net in business to deliver actual service and create real value--rather than hype and image".--Esther Dyson, Chairman, EDventure Holdings.
One-to-One Web Marketing: Build a Relationship Marketing Strategy One Customer at a Time with Cdrom, 2nd edition
Authors: Cliff Allen, Deborah Kania, Beth Yaeckel
Venue:  (2001)

:A comprehensive resource on implementing a one-to-one marketing strategy on the WebWith its unique focus on customer-oriented marketing strategy, One-to-One Web Marketing immediately became a bestseller among Internet business books when it was first published in 1998. Now in a second edition, this is still the only comprehensive resource for understanding and applying the latest technologies, tools, products, and solutions for one-to-one marketing on the Web. With 40% new material, the Second Edition features a full arsenal of checklists, flowcharts, templates, vendor lists, scripting examples, and other tools and information that readers can use to evaluate and implement one-to-one technologies.
Parallel Processing Algorithms for GIS
Authors: Richard G. Healey, M. J. Minetar, Steve Dowers
Venue:  (1997)

:Parallel processing is a technology now coming of age in a diversity of application domains, notably GIS where large data sets are involved. This text focuses on the ways in which technology can be applied to GIS applications, emphasizing software
Call admission control and load balancing for voice over IP
Authors: David Houck, Gopal Meempat
Venue: Performance Evaluation (2002)

IP networks are traditionally designed to support a best-effort service, with no guarantees on the reliable and timely delivery of packets. With the migration of real-time applications such as voice onto IP-based platforms, the existing IP network capabilities become inadequate to provide the quality-of-service (QoS) levels that the end-users are accustomed to. While new protocols such as DiffServ and MPLS allow some amount of traffic prioritization, guaranteed QoS requires call admission control. This paper reviews several possible implementations and shows simulation results for one promising method that makes efficient use of the network and is scalable to large networks.
Data Broadcasting: The Technology and the Business, 1st edition
Authors: Lars Tvede, Peter Pircher, Jens Bodenkamp
Venue:  (1999)

:Data broadcasting is a concept describing the continuous broadcast via high bandwidth networks of video, audio, software programs, Internet content, and streaming data flows to devices such as PCs and digital set top boxes. Widely expected to replace conventional broadcasting (which transmits information to television and radio via satellite, cable, terrestrial), data broadcasting will drastically alter the shape of media--how it's created, used, and distributed, both professionally and privately. This book will be the key reference for professionals in such industries as media, broadcasting, IT, PC, set top box, chips, software and finance who need to learn what the technology is all about, how it differs from established technologies, what it is used for, and the derived business structures.
Pseudorandomness and Cryptographic Applications
Authors: Michael George Luby, Luby Michael
Venue:  (1994)

:A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack. There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to compute but hard for any efficient adversary to invert on average. The first half of the book shows how to construct a pseudorandom generator from any one-way function. Building on this, the second half of the book shows how to construct other useful cryptographic primitives, such as private key cryptosystems, pseudorandom function generators, pseudorandom permutation generators, digital signature schemes, bit commitment protocols, and zero-knowledge interactive proof systems. The book stresses rigorous definitions and proofs.
Coupling an Eulerian fluid calculation to a Lagrangian solid calculation with the ghost fluid method
Authors: Ronald P. Fedkiw
Venue: Journal of Computational Physics (2002)

We propose a numerical method for modeling multimaterial flows where the domain is decomposed into separate Eulerian and Lagrangian subdomains. That is, the equations are written in Eulerian form in one subdomain and in Lagrangian form in the other subdomain. This is of interest, for example, when considering the effect of underwater explosions on the hull of a ship or the impact of a low speed projectile on a soft explosive target. On the one hand, high-speed fluid flows are traditionally modeled by applying shock-capturing schemes to the compressible Euler equations to avoid problems associated with tangling of a Lagrangian mesh. On the other hand, solid dynamics calculations are traditionally carried out using Lagrangian numerical methods to avoid problems associated with numerical smearing in Eulerian calculations. We use the ghost fluid method to create accurate discretizations across the Eulerian/Lagrangian interface. The numerical method is presented in both one and two spatial dimensions; three-dimensional extensions (to the interface coupling method) are straightforward.
Information Ages: Literacy, Numeracy, and the Computer Revolution
Authors: Michael E. Hobart, Zachary Sayre Schiffman
Venue:  (1998)

:The late 20th century is trumpeted as the Information Age by pundits and politicians alike, and on the face of it, the claim requires no justification. But in Information Ages, Michael E. Hobart and Zachary S. Schiffman challenge this widespread assumption. In a sweeping and captivating history of information technology from the ancient Sumerians to the world of Alan Turing and John von Neumann, the authors show how revolutions in the technology of information storage - from the invention of writing approximately 5000 years ago to the mathematical models for describing physical reality in the 17th and 18th centuries to the introduction of computers - profoundly transformed ways of thinking.
Object-Oriented Programming in Eiffel: 2nd Ed., 2nd edition
Authors: Peter Thomas, Ray Weedon
Venue:  (1998)

:Eiffel is a hybrid language with both imperative and object-oriented features. The language includes features to support abstract data types, inheritance, and dynamic building, so it fully supports object-oriented programming.
Select-free instruction scheduling logic
Authors: Mary D. Brown, Jared Stark, Yale N. Patt
Venue: Proceedings of the 34th annual ACM/IEEE international symposium on Microarchitecture (2001)

Pipelining allows processors to exploit parallelism. Unfortunately, critical loops---pieces of logic that must evaluate in a single cycle to meet IPC (Instructions Per Cycle) goals---prevent deeper pipelining. In today's processors, one of these loops is the instruction scheduling (wakeup and select) logic [10]. This paper describes a technique that pipelines this loop by breaking it into two smaller loops: a critical, single-cycle loop for wakeup; and a non-critical, potentially multi-cycle, loop for select. For the 12 SPECint*2000 benchmarks, a machine with two-cycle select logic (i. e., three-cycle scheduling logic) using this technique has an average IPC 15% greater than a machine with three-cycle pipelined conventional scheduling logic, and an IPC within 3% of a machine of the same pipeline depth and one-cycle (ideal) scheduling logic. Since select accounts for more than half the scheduling latency [10], this technique could significantly increase clock frequency while having minimal impact on IPC.
Computer Interfacing: A General Introduction to Computers, Covering All Aspects of Hardware ....
Authors: Graham Dixey
Venue:  (1994)

:This book explains how computers interact with the world around them and therefore how to make them a useful tool. Topics covered include descriptions of all the components that make up a computer, principles of data exchange, interaction with peripherals, serial communication, input devices, recording methods, computer controlled motors, and printers. With plenty of handy tips and clear illustrations this book can improve your computer system, and even show new uses for old kit, such as motor control. 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
MCSE: NT Server in the Enterprise Testing Success
Authors: Lisa Donald, Frank Cabiroy, Bruce Moran
Venue:  (1997)

:Going for your MCSE? Use this new MCSE Testing Guide to make sure you're ready for the NT Server 4 in the Enterprise exam. The book provides summaries of the essential topics, and includes more than 600 with detailed answers and more than 150 sample test questions. The CD includes a test-simulation program for getting ready to take the computer-based exams, and the Network Press MCSE Study Guide Sampler.
Visual Basic 6 Core Requirements with Cdrom
Authors: Ian Lewis, McKelvy, Gellis
Venue:  (1999)

:Programmers facing Visual Basic core exams for the full Microsoft Certified Solution Developer certification can find out all they need to know about the core Analyzing Requirements exam, as well as the two Visual Basic exams for Desktop and Distributed Applications. The package is augmented by a CD-ROM of self-testing software that includes more than 1,000 questions for the three exams.
Optimizing Epochal Evolutionary Search: Population-Size Dependent Theory
Authors: Erik Van Nimwegen, James P. Crutchfield
Venue: Machine Learning (2001)

Epochal dynamics, in which long periods of stasis in an evolving population are punctuated by a sudden burst of change, is a common behavior in both natural and artificial evolutionary processes. We analyze the population dynamics for a class of fitness functions that exhibit epochal behavior using a mathematical framework developed recently, which incorporates techniques from the fields of mathematical population genetics, molecular evolution theory, and statistical mechanics. Our analysis predicts the total number of fitness function evaluations to reach the global optimum as a function of mutation rate, population size, and the parameters specifying the fitness function. This allows us to determine the optimal evolutionary parameter settings for this class of fitness functions.We identify a generalized error threshold that smoothly bounds the two-dimensional regime of mutation rates and population sizes for which epochal evolutionary search operates most efficiently. Specifically, we analyze the dynamics of epoch destabilization under finite-population sampling fluctuations and show how the evolutionary parameters effectively introduce a coarse graining of the fitness function. More generally, we find that the optimal parameter settings for epochal evolutionary search correspond to behavioral regimes in which the consecutive epochs are marginally stable against the sampling fluctuations. Our results suggest that in order to achieve optimal search, one should set evolutionary parameters such that the coarse graining of the fitness function induced by the sampling fluctuations is just large enough to hide local optima.
Viability Kernels and Capture Basins of Sets Under Differential Inclusions
Authors: Jean-Pierre Aubin
Venue: SIAM Journal on Control and Optimization (2001)

This paper provides a characterization of viability kernels and capture basins of a target viable in a constrained subset as a unique closed subset between the target and the constrained subset satisfying tangential conditions or, by duality, normal conditions. It is based on a method devised by Hélène Frankowska for characterizing the value function of an optimal control problem as generalized (contingent or viscosity) solutions to Hamilton--Jacobi equations. These abstract results, interesting by themselves, can be applied to epigraphs of functions or graphs of maps and happen to be very efficient for solving other problems, such as stopping time problems, dynamical games, boundary-value problems for systems of partial differential equations, and impulse and hybrid control systems, which are the topics of other companion papers.
Lotus SmartSuite for Dummies, 1st edition
Authors: Michael Meadhra, Bodo, Michael O'Mara, Jan Weingarten
Venue:  (1998)

:Streamline your workday by using this fully integrated suite of powerful work tools. With clear explanations and tons of timesaving tips, Lotus SmartSuite Millennium Edition For Dummies shows you how to create outstanding memos, reports, and spreadsheets, unique multimedia presentations, and even eye-popping Web pages -- in no time! Inside, find helpful advice on how to Get an overview of each program in the respective "Boot Camp" chapters Use the new FastSite program to build and publish an entire Web site Dictate memos, letters, and reports straight to your computer by using SmartSuite's new ViaVoice feature Flow data into manageable spreadsheets and let 1-2-3 crunch the numbers Create, manage, and join complex databases easily with Approach Choose from more than 100 dazzling Freelance Graphics presentation formats Use Organizer to maintain your schedule, store contact data, and keep a to-do list